Sciweavers

1247 search results - page 80 / 250
» A Generalization of Jumps and Labels
Sort
View
COLT
2005
Springer
14 years 3 months ago
The Value of Agreement, a New Boosting Algorithm
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
Boaz Leskes
ICALP
2004
Springer
14 years 3 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
IEAAIE
2004
Springer
14 years 3 months ago
Iterative Semi-supervised Learning: Helping the User to Find the Right Records
This paper proposes extending semi-supervised learning by allowing an ongoing interaction between a user and the system. The extension is intended to not only to speed up search fo...
Chris Drummond
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
14 years 2 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
WADT
1998
Springer
14 years 2 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...