68 search results - page 3 / 14 » Distributed similarity search in high dimensions using local... |
154
click to vote
ICASSP
2008
IEEE
16 years 13 days ago
2008
IEEE
This paper proposes a query by humming method based on locality sensitive hashing (LSH). The method constructs an index of melodic fragments by extracting pitch vectors from a dat...
168
click to vote
PAMI
2006
15 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...
339
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
161
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
151
click to vote
COMPGEOM
2006
ACM
15 years 12 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...