26 search results - page 5 / 6 » Counting by Coin Tossings |
COCO
2009
Springer
14 years 1 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
TCSV
2010
13 years 1 months ago
2010
While peer-to-peer (P2P) video streaming systems have achieved promising results, they introduce a large number of unnecessary traverse links, which consequently leads to substanti...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
ICDCS
2010
IEEE
13 years 10 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The way a rational agent changes her belief in certain proposition/hypotheses in the light of new evidence lies in the heart of Bayesian inference. The basic natural assumption, a...