473 search results - page 53 / 95 » Computing shortest paths with uncertainty |
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
TKDE
2010
14 years 8 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we propose a Particle Filter-based propagation approach for the segmentation of vascular structures in 3D volumes. Because of pathologies and inhomogeneities, many de...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...