Sciweavers

2048 search results - page 22 / 410
» The Tale of Two Projects - Abstract
Sort
View
ECCC
2010
82views more  ECCC 2010»
14 years 11 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
DGCI
2006
Springer
15 years 3 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
CORR
2007
Springer
51views Education» more  CORR 2007»
14 years 11 months ago
Projection semantics for rigid loops
A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax ...
Jan A. Bergstra, Alban Ponse
WWW
2006
ACM
16 years 12 days ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 1 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe