Sciweavers

315 search results - page 11 / 63
» Shortest path optimization under limited information
Sort
View
COR
2008
142views more  COR 2008»
15 years 4 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
ICC
2009
IEEE
101views Communications» more  ICC 2009»
15 years 3 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang
ECCV
2006
Springer
16 years 7 months ago
Globally Optimal Active Contours, Sequential Monte Carlo and On-Line Learning for Vessel Segmentation
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...
Charles Florin, Nikos Paragios, James Williams
INFOCOM
2003
IEEE
15 years 10 months ago
IP-Subnet Aware Routing in WDM Mesh Networks
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...
Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anur...
PE
2010
Springer
137views Optimization» more  PE 2010»
15 years 3 months ago
Tail-robust scheduling via limited processor sharing
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
Jayakrishnan Nair, Adam Wierman, Bert Zwart