1552 search results - page 163 / 311 » On the Complexity of Constant Propagation |
158
click to vote
ICML
2001
IEEE
16 years 7 months ago
2001
IEEE
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
180
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
171
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
167
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
168
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...