Sciweavers

989 search results - page 108 / 198
» Pebbling and Proofs of Work
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ICSE
2010
IEEE-ACM
13 years 10 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
ICCV
2003
IEEE
14 years 10 months ago
"Perspective Shape from Shading" and Viscosity Solutions
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
Emmanuel Prados, Olivier D. Faugeras
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 8 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty