256 search results - page 17 / 52 » Approximation Algorithms for Hamming Clustering Problems |
SPIRE
2010
Springer
14 years 10 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
151
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
106
click to vote
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
—Fuzzy/similarity joins have been widely studied in the research community and extensively used in real-world applications. This paper proposes and evaluates several algorithms f...
133
click to vote
STRINGOLOGY
2004
15 years 1 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
ICMLA
2008
15 years 1 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...