Sciweavers

916 search results - page 112 / 184
» Algorithm selection: a quantitative computation-intensive op...
Sort
View
TON
2002
81views more  TON 2002»
15 years 2 months ago
Robust rate control for integrated services packet networks
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
Franco Blanchini, Renato Lo Cigno, Roberto Tempo
JACM
2006
99views more  JACM 2006»
15 years 3 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
CIKM
2008
Springer
15 years 5 months ago
Proactive learning: cost-sensitive active learning with multiple imperfect oracles
Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical applications. Active learning seeks to select the m...
Pinar Donmez, Jaime G. Carbonell
DAC
2003
ACM
16 years 4 months ago
Design techniques for sensor appliances: foundations and light compass case study
We propose the first systematic, sensor-centric approach for quantitative design of sensor network appliances. We demonstrate its use by designing light appliance devices and the ...
Jennifer L. Wong, Seapahn Megerian, Miodrag Potkon...
146
Voted
MICCAI
2009
Springer
15 years 7 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eï¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...