8728 search results - page 1322 / 1746 » On Reduct Construction Algorithms |
188
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
175
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
200
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
174
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
182
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...