32 search results - page 7 / 7 » Mining preferences from superior and inferior examples |
CAV
1999
Springer
13 years 9 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...