12 search results - page 1 / 3 » Verifying and decoding in constant depth |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
CVPR
2000
IEEE
14 years 7 months ago
2000
IEEE
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
ECCC
2011
12 years 12 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...