Sciweavers

76 search results - page 4 / 16
» Performance Evaluation of Using a Dynamic Shortest Path Algo...
Sort
View
EMMCVPR
2003
Springer
13 years 11 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
MOBICOM
2003
ACM
13 years 11 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
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...
Anand Srinivas, Eytan Modiano
CN
2002
195views more  CN 2002»
13 years 5 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
13 years 11 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang
SIGPRO
2008
201views more  SIGPRO 2008»
13 years 5 months ago
Multichannel blind seismic deconvolution using dynamic programming
In this paper, we present an algorithm for multichannel blind deconvolution of seismic signals, which exploits lateral continuity of earth layers by dynamic programming approach. ...
Alon Heimer, Israel Cohen