Sciweavers

467 search results - page 41 / 94
» Generating labels from clicks
Sort
View
COLT
2005
Springer
14 years 2 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
IPPS
2003
IEEE
14 years 2 months ago
The Reconstruction of a Mobile Agent Computation and Its Validation
We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed coms are abstracte...
Mamoun Filali, Philippe Mauran, Gérard Padi...
ICALP
1998
Springer
14 years 1 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
ACL
1998
13 years 10 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu
EMNLP
2009
13 years 6 months ago
Self-Training PCFG Grammars with Latent Annotations Across Languages
We investigate the effectiveness of selftraining PCFG grammars with latent annotations (PCFG-LA) for parsing languages with different amounts of labeled training data. Compared to...
Zhongqiang Huang, Mary P. Harper