80 search results - page 9 / 16 » Nearest Neighbor Search Using Additive Binary Tree |
ECCV
2010
Springer
14 years 1 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...
ACMSE
2007
ACM
13 years 12 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...