Sciweavers

214 search results - page 21 / 43
» Fast Nearest Neighbor Search in High-Dimensional Space
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
FOCS
2008
IEEE
15 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDE
2009
IEEE
169views Database» more  ICDE 2009»
15 years 11 months ago
Visible Reverse k-Nearest Neighbor Queries
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, data mining, etc. Previous work on RNN ...
Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien ...
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
15 years 11 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...
PVLDB
2010
152views more  PVLDB 2010»
14 years 7 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...