Sciweavers

763 search results - page 119 / 153
» Engineering Shortest Path Algorithms
Sort
View
GIS
2003
ACM
14 years 8 months ago
Constructing a dem from grid-based data by computing intermediate contours
We present a technique for creating a digital elevation model (DEM) from grid-based contour data. The method computes new, intermediate contours in between existing isolines. Thes...
Michael B. Gousie, Wm. Randolph Franklin
PODC
1997
ACM
13 years 12 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...
IANDC
2008
92views more  IANDC 2008»
13 years 7 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
CVPR
2006
IEEE
14 years 9 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
INFOCOM
2005
IEEE
14 years 1 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...