44 search results - page 5 / 9 » Fast shortest path distance estimation in large networks |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
KDD
2004
ACM
14 years 27 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
ALGORITHMICA
2011
13 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...