40 search results - page 3 / 8 » The Value of Agreement, a New Boosting Algorithm |
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
COLT
2005
Springer
14 years 17 days ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
SIAMCOMP
2008
13 years 5 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
24
Voted
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents an analytical model of steady state throughput of the Slow-but-Steady variant of TCP NewReno as a function of loss event rate, average number of segments lo...
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...