158 search results - page 21 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
SODA
2004
ACM
14 years 10 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...
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
79
Voted
SPIESR
2004
14 years 10 months ago
2004
This paper presents an overview of our recent work on managing image and video data. The first half of the paper describes a representation for the semantic spatial layout of vide...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
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...
126
Voted
VLSISP
2010
14 years 7 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...