154 search results - page 11 / 31 » On Boosting with Polynomially Bounded Distributions |
ML
2007
ACM
13 years 9 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
TIT
2002
13 years 9 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
ICML
1996
IEEE
14 years 10 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
SPAA
2006
ACM
14 years 3 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...