371 search results - page 39 / 75 » Partition Theorems and Computability Theory |
117
click to vote
COLT
2001
Springer
15 years 2 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
CONCUR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
CAGD
2007
14 years 9 months ago
2007
Energies of curves and surfaces together with their discrete variants play a prominent role as fairness functionals in geometric modeling and computer aided geometric design. This ...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
ENTCS
2006
14 years 9 months ago
2006
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...