1434 search results - page 13 / 287 » Distributed Computing with Imperfect Randomness |
PODC
1998
ACM
13 years 11 months ago
1998
ACM
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
JMLR
2010
13 years 2 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE