Sciweavers

2 search results - page 1 / 1
» Fast nearest-neighbor search in disk-resident graphs
Sort
View
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 11 months ago
Fast Nearest Neighbor Search on Road Networks
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...
Haibo Hu, Dik Lun Lee, Jianliang Xu
CVPR
2004
IEEE
15 years 26 days 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