183 search results - page 21 / 37 » Winner-Update Algorithm for Nearest Neighbor Search |
SSD
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
SIGMOD
2010
ACM
14 years 7 days ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
ECCV
2010
Springer
14 years 19 days 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...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...