50 search results - page 7 / 10 » On the Computational Complexity of Coin Flipping |
COCO
2009
Springer
14 years 2 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...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we address the problem of privacy in video surveillance systems. More specifically, we consider the case of H.264/AVC which is the state-of-the-art in video coding....
VC
2008
13 years 7 months ago
2008
Abstract We propose a particle-based technique for simulating incompressible fluid that includes adaptive refinement of particle sampling. Each particle represents a mass of fluid ...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...