244 search results - page 12 / 49 » On-Line Probability, Complexity and Randomness |
CORR
2000
Springer
13 years 8 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
CAV
2001
Springer
14 years 16 days ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
SSIAI
2000
IEEE
14 years 1 months ago
2000
IEEE
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...