Sciweavers

CCCG
2001
14 years 3 days ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 2 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
3DIM
2001
IEEE
14 years 2 months ago
A Nearest Neighbor Method for Efficient ICP
A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The refer...
Michael A. Greenspan, Guy Godin
FOCS
1999
IEEE
14 years 3 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
COMPGEOM
2004
ACM
14 years 4 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
FOCS
2006
IEEE
14 years 4 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
FOCS
2006
IEEE
14 years 4 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
DNIS
2010
Springer
250views Database» more  DNIS 2010»
14 years 5 months ago
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...