Sciweavers

1076 search results - page 51 / 216
» Operations on proofs and labels
Sort
View
KDD
2003
ACM
157views Data Mining» more  KDD 2003»
14 years 8 months ago
Cross-training: learning probabilistic mappings between topics
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
Sunita Sarawagi, Soumen Chakrabarti, Shantanu Godb...
CCS
2009
ACM
14 years 2 months ago
A metadata calculus for secure information sharing
In both commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information to the concerned actors. Traditional approaches to informa...
Mudhakar Srivatsa, Dakshi Agrawal, Steffen Reidt
COLT
2005
Springer
14 years 1 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
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
13 years 12 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...
LICS
2008
IEEE
14 years 2 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy