4255 search results - page 9 / 851 » On Learning Boolean Functions |
COCO
2001
Springer
14 years 4 days ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r o...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...