65 search results - page 6 / 13 » Lower Bounds for High Dimensional Nearest Neighbor Search an... |
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
ISM
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...