96 search results - page 17 / 20 » On Several Proofs of the Recognizability Theorem |
COLT
2008
Springer
14 years 11 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...
FUIN
2007
14 years 9 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
PE
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
DATAMINE
1998
14 years 9 months ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...