1278 search results - page 96 / 256 » The Complexity of Weighted Boolean |
132
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
107
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
141
Voted
FCS
2006
15 years 5 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
129
Voted
EMNLP
2007
15 years 5 months ago
2007
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
154
Voted
STOC
2010
ACM
16 years 29 days ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...