Sciweavers

158 search results - page 32 / 32
» High dimensional reverse nearest neighbor queries
Sort
View
COMPGEOM
2010
ACM
13 years 10 months ago
A dynamic data structure for approximate range searching
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 ...
David M. Mount, Eunhui Park
PAMI
2006
132views more  PAMI 2006»
13 years 5 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
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...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
CVPR
2007
IEEE
13 years 11 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao