Sciweavers

1414 search results - page 113 / 283
» Randomness and Universal Machines
Sort
View
COLT
2007
Springer
14 years 4 months ago
Strategies for Prediction Under Imperfect Monitoring
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
Gábor Lugosi, Shie Mannor, Gilles Stoltz
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 3 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
LATIN
1998
Springer
14 years 2 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
SPAA
1994
ACM
14 years 2 months ago
An Optical Simulation of Shared Memory
We present a work-optimal randomized algorithm for simulating a shared memory machine (pram) on an optical communication parallel computer (ocpc). The ocpc model is motivated by t...
Leslie Ann Goldberg, Yossi Matias, Satish Rao
ICML
2010
IEEE
13 years 11 months ago
Supervised Aggregation of Classifiers using Artificial Prediction Markets
Prediction markets are used in real life to predict outcomes of interest such as presidential elections. In this work we introduce a mathematical theory for Artificial Prediction ...
Nathan Lay, Adrian Barbu