467 search results - page 56 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
ECCV
2006
Springer
14 years 9 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
13 years 9 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
14 years 10 days 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 ...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
MASCOTS
2004
13 years 8 months ago
2004
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...