18 search results - page 4 / 4 » Near-Optimal Hashing Algorithms for Approximate Nearest Neig... |
SIAMSC
2008
13 years 5 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
PAMI
2006
13 years 5 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...