158 search results - page 13 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
CCCG
2008
14 years 11 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
100
Voted
CVDB
2004
ACM
15 years 2 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...
152
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
SODA
1993
ACM
14 years 10 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...