1449 search results - page 201 / 290 » Self-Randomized Exponentiation Algorithms |
169
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
203
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
149
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
164
click to vote
STOC
1989
ACM
15 years 10 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
198
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...