Sciweavers

Share
7 search results - page 1 / 2
» A Counterexample to Strong Parallel Repetition
Sort
View
FOCS
2008
IEEE
10 years 5 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 βˆ’ (for, say, ≀ 1/2), the value of the game repeated in parallel n times is at most (1 βˆ’ c)β...
Ran Raz
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
10 years 5 months ago
Strong Parallel Repetition Theorem for Free Projection Games
The parallel repetition theorem states that for any two provers one round game with value at most 1 βˆ’ (for < 1/2), the value of the game repeated n times in parallel is at mo...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
ECCC
2010
82views more  ECCC 2010»
9 years 10 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
10 years 2 months ago
Derandomized Parallel Repetition Theorems for Free Games
β€”Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 βˆ’ (for ≀ 1/2), the v...
Ronen Shaltiel
CVPR
2009
IEEE
11 years 5 months ago
Recognition of Repetitive Sequential Human Activity
We present a novel framework for recognizing repetitive sequential events performed by human actors with strong temporal dependencies and potential parallel overlap. Our solutio...
Akira Yanagawa, Arun Hampapur, Quanfu Fan, Russell...
books