34 search results - page 1 / 7 » Finding Data Broadness Via Generalized Nearest Neighbors |
73
Voted
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
ECCV
2008
Springer
16 years 6 days ago
2008
Springer
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
166
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
118
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...