45 search results - page 4 / 9 » Fast k-Means Algorithms with Constant Approximation |
ALGORITHMICA
2005
13 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
IJCAI
2007
13 years 7 months ago
2007
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
DATESO
2007
13 years 7 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
SBBD
2000
13 years 7 months ago
2000
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...