8 search results - page 1 / 2 » Minimizing Average Shortest Path Distances via Shortcut Edge... |
APPROX
2009
Springer
13 years 10 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
APPROX
2009
Springer
13 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
CLUSTER
2002
IEEE
13 years 4 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
CHI
2011
ACM
12 years 7 months ago
2011
ACM
When pointing to a target on a computer desktop, we may think we are taking the shortest possible path. But new shortcuts become possible if we allow the mouse cursor to jump from...
MICCAI
2009
Springer
14 years 5 months ago
2009
Springer
This paper describes a system to automatically segment the left ventricle in all slices and all phases of cardiac cine magnetic resonance datasets. After localizing the left ventri...