16 search results - page 1 / 4 » Smooth Tradeoffs between Insert and Query Complexity in Near... |
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
ACIVS
2006
Springer
13 years 11 months ago
2006
Springer
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
MDM
2010
Springer
13 years 7 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...