184 search results - page 12 / 37 » Near Neighbor Search in Large Metric Spaces |
70
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
TVCG
2010
14 years 8 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
115
click to vote
ALENEX
2001
14 years 11 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...
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
100
click to vote
CVDB
2004
ACM
15 years 3 months ago
2004
ACM
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...