6 search results - page 1 / 2 » Empirical Evaluation of the Difficulty of Finding a Good Val... |
ICCS
2003
Springer
13 years 10 months ago
2003
Springer
ECCV
2008
Springer
14 years 6 months 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...
SIGMOD
2006
ACM
14 years 4 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...
PAMI
2006
13 years 4 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
PVLDB
2010
12 years 11 months ago
2010
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...