Sciweavers

30 search results - page 1 / 6
» Practical Nearest Neighbor Search in the Plane
Sort
View
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
13 years 10 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
NIPS
2004
13 years 5 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 3 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
EDBT
2004
ACM
119views Database» more  EDBT 2004»
14 years 3 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 3 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis