138 search results - page 13 / 28 » K-Nearest Neighbor Search for Moving Query Point |
113
click to vote
WEA
2010
Springer
15 years 6 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
104
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
ESORICS
2009
Springer
15 years 6 months ago
2009
Springer
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...
117
click to vote
COCOON
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...