32 search results - page 1 / 7 » On locality sensitive hashing in metric spaces |
SISAP
2010
IEEE
13 years 3 months ago
2010
IEEE
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
PAMI
2006
13 years 4 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...
CVPR
2010
IEEE
14 years 24 days ago
2010
IEEE
Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been show...