206 search results - page 9 / 42 » Weak Alternating Automata Are Not That Weak |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
CCR
2007
13 years 7 months ago
2007
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
COORDINATION
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
d Abstract) Jochen Eisinger1 and Felix Klaedtke2 1 Albert-Ludwigs-Universit