92 search results - page 8 / 19 » Quality and efficiency in high dimensional nearest neighbor ... |
100
click to vote
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
151
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: 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, has received increasing a...
92
Voted
ACCV
2007
Springer
15 years 1 months ago
2007
Springer
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...