Closest string - PDFSEARCH.IO - Document Search Engine

Closest string
Results: 14

#	Item
1	PDF Document Add to Reading List Source URL: www.tnt.uni-hannover.de Language: English - Date: 2011-07-12 09:56:56 Artificial intelligence Computer vision Vision Dynamic programming Pattern matching Feature detection Robot control Iterative closest point Shape context Conference on Computer Vision and Pattern Recognition Speeded up robust features Approximate string matching
2	Finding Optimal Alignment and Consensus of Circular Strings T. Lee, J.C. Na, H. Park, K. Park, and J.S. Sim Seoul National University June 23, 2010 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:46:00 Cubes Hamming distance Metric geometry Distance Closest string Geometry Mathematics Coding theory
3	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
4	Custom Care Spare Parts Bars CUSTOM CARE PARTS – SEAT COMPONENT ORDERS CAN BE MADE BY CONTACTING YOUR CLOSEST CUSTOM CARE NEW SOUTH WALES & ACT Add to Reading List Source URL: custom.tmserver.com.au Language: English - Date: 2011-02-10 00:46:20 String Trimming
5	Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk. Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:10 Coding theory Error detection and correction Matrices Computer arithmetic Numerical linear algebra Matrix Logical matrix Hamming Closest string Algebra Mathematics Linear algebra
6	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
7	Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´ Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-26 10:03:32 Coding theory Analysis of algorithms Computational complexity theory Closest string Hamming distance Time complexity Algorithmica Theoretical computer science Applied mathematics NP-complete problems
8	CLOSEST STRING MATCHING TANACHAI PATHOMRAT A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR Add to Reading List Source URL: www.li.mahidol.ac.th Language: English - Date: 2004-02-27 01:44:06 Coding theory Dynamic programming Closest string Hamming distance String Approximate string matching Mathematics Theoretical computer science Combinatorics
9	LATEST INNOVATIONS pginnovation.com The all-new Braun Series 9 provides the brand’s closest and most comfortable shave ever, removing more hair in the first stroke than any other shaver, proven on 3-day beards. The sha Add to Reading List Source URL: www.pg.com Language: English - Date: 2014-12-03 03:40:40 Depilation Fashion Hair Beard Braun String trimmer Glabrousness Facial hair Beauty Shaving
10	Information and Computation[removed]–55 www.elsevier.com/locate/ic Add to Reading List Source URL: www.math.nus.edu.sg Language: English - Date: 2003-07-25 20:48:35 Complexity classes Structural complexity theory Closest string String Formal languages NP Substring Hamming distance P versus NP problem Theoretical computer science Mathematics Applied mathematics

UPDATE