88 search results - page 6 / 18 » A new approach to dynamic all pairs shortest paths |
112
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
223
Voted
GIS
2006
ACM
16 years 2 months ago
2006
ACM
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
119
Voted
JNW
2008
15 years 1 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
116
click to vote
GIS
2002
ACM
15 years 1 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
106
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...