256 search results - page 2 / 52 » Approximation Algorithms for Hamming Clustering Problems |
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
COCO
2009
Springer
14 years 14 hour ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
JDA
2008
13 years 5 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
APPROX
2009
Springer
14 years 1 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...