Sciweavers

315 search results - page 41 / 63
» Simple Distributed Weighted Matchings
Sort
View
COLT
2001
Springer
14 years 5 days ago
Smooth Boosting and Learning with Malicious Noise
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
Rocco A. Servedio
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 11 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
CVPR
2010
IEEE
13 years 11 months ago
Lymph Node Detection in 3-D Chest CT using a Spatial Prior Probability
Lymph nodes have high clinical relevance but detection is challenging as they are hard to see due to low contrast and irregular shape. In this paper, a method for fully automatic ...
Johannes Feulner, Kevin Zhou, Martin Huber, Joachi...
JSAC
2006
104views more  JSAC 2006»
13 years 7 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
MSR
2010
ACM
14 years 22 days ago
The Ultimate Debian Database: Consolidating bazaar metadata for Quality Assurance and data mining
—FLOSS distributions like RedHat and Ubuntu require a lot more complex infrastructures than most other FLOSS projects. In the case of community-driven distributions like Debian, ...
Lucas Nussbaum, Stefano Zacchiroli