Sciweavers

87 search results - page 9 / 18
» Approximate Nearest Neighbor Queries Revisited
Sort
View
FOCS
2008
IEEE
15 years 8 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
DFG
2007
Springer
15 years 8 months ago
Natural Neighbor Concepts in Scattered Data Interpolation and Discrete Function Approximation
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
Tom Bobach, Georg Umlauf
PAMI
2011
14 years 8 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
187
Voted
JPDC
2007
138views more  JPDC 2007»
15 years 1 months ago
Distributed computation of the knn graph for large high-dimensional point sets
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...
Erion Plaku, Lydia E. Kavraki
COMPGEOM
2004
ACM
15 years 7 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 ...