Sciweavers

93 search results - page 16 / 19
» Query-Efficient Locally Decodable Codes
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
13 years 6 months ago
Local Monotonicity Reconstruction
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...
Michael E. Saks, C. Seshadhri
DCC
2007
IEEE
14 years 7 months ago
Spectral Predictors
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...
Lorenzo Ibarria, Peter Lindstrom, Jarek Rossignac
CADE
2000
Springer
14 years 8 days ago
Machine Instruction Syntax and Semantics in Higher Order Logic
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 ...
Neophytos G. Michael, Andrew W. Appel
DCC
2010
IEEE
14 years 1 months ago
Tanner Graph Based Image Interpolation
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...
Ruiqin Xiong, Wen Gao