2 search results - page 1 / 1 » Fast nearest-neighbor search in disk-resident graphs |
EDBT
2006
ACM
14 years 11 months ago
2006
ACM
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...
CVPR
2004
IEEE
15 years 27 days ago
2004
IEEE
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...