473 search results - page 41 / 95 » Computing shortest paths with uncertainty |
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
WAW
2007
Springer
15 years 3 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
103
click to vote
GSN
2009
Springer
15 years 1 months ago
2009
Springer
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
72
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...