233 search results - page 15 / 47 » An Investigation of Practical Approximate Nearest Neighbor A... |
101
click to vote
COMPGEOM
2006
ACM
15 years 6 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...
189
Voted
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
109
click to vote
DEXA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
169
click to vote
JPDC
2007
15 years 8 days ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
132
Voted
CVPR
1997
IEEE
16 years 2 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...