Sciweavers

331 search results - page 4 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
TPDS
2002
155views more  TPDS 2002»
13 years 7 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
14 years 8 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
ICCV
2001
IEEE
14 years 9 months ago
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
ICIP
2007
IEEE
14 years 1 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
IBPRIA
2007
Springer
14 years 1 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ó...