93 search results - page 16 / 19 » Query-Efficient Locally Decodable Codes |
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
SIAMCOMP
2010
14 years 10 months ago
2010
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done usin...
104
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
80
Voted
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...