Sciweavers

497 search results - page 66 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
15 years 3 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
TMI
2002
248views more  TMI 2002»
14 years 9 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson
RTSS
2005
IEEE
15 years 3 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
4OR
2010
148views more  4OR 2010»
14 years 8 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...