314 search results - page 6 / 63 » Succinct nearest neighbor search |
ALENEX
2001
13 years 9 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
TKDE
2010
13 years 6 months ago
2010
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
STOC
1998
ACM
14 years 4 days ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...