2354 search results - page 246 / 471 » Randomness, Stochasticity and Approximations |
163
click to vote
JMLR
2010
15 years 24 days ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
185
click to vote
FOCS
2007
IEEE
16 years 10 days ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
175
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
181
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
145
click to vote
SACRYPT
1998
Springer
15 years 10 months ago
1998
Springer
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...