2168 search results - page 210 / 434 » Randomized Algorithms and Complexity Theory |
149
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
140
click to vote
JMLR
2010
15 years 2 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
132
click to vote
EDBTW
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
107
click to vote
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
123
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...