Sciweavers

89 search results - page 1 / 18
» Fast Algorithm for Nearest Neighbor Search Based on a Lower ...
Sort
View
ICCV
2001
IEEE
14 years 6 months ago
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
PR
2007
155views more  PR 2007»
13 years 4 months ago
Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
Yong-Sheng Chen, Yi-Ping Hung, Ting-Fang Yen, Chio...
IBPRIA
2007
Springer
13 years 10 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
PAMI
2008
152views more  PAMI 2008»
13 years 4 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
STOC
1999
ACM
80views Algorithms» more  STOC 1999»
13 years 8 months ago
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
Allan Borodin, Rafail Ostrovsky, Yuval Rabani