Sciweavers

331 search results - page 7 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 7 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 9 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
ICPR
2000
IEEE
14 years 8 months ago
Tandem Fusion of Nearest Neighbor Editing and Condensing Algorithms - Data Dimensionality Effects
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
Belur V. Dasarathy, José Salvador Sá...
CVPR
2003
IEEE
14 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
13 years 11 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...