118 search results - page 14 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
114
click to vote
BCS
2008
15 years 1 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
105
click to vote
ALGORITHMICA
2005
14 years 11 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...
PAMI
2010
14 years 10 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
EDBT
2008
ACM
15 years 11 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
IJCAI
2007
15 years 1 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...