425 search results - page 22 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
ISPAN
2005
IEEE
14 years 2 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper presents a new method to extract a network of vessels centerlines from a medical
image. The network is composed of local geodesics over a four-dimensional space that in...
IJICT
2007
13 years 8 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...