Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
46
Verifying and decoding in constant depth
- In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing
, 2007
"... We develop a general approach for improving the efficiency of a computationally bounded receiver interacting with a powerful and possibly malicious sender. The key idea we use is that of delegating some of the receiver’s computation to the (potentially malicious) sender. This idea was recently intro ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
that are locally (list-)decodable by constant-depth circuits of size polylogarithmic in the length of the codeword. Using the tight connection between locally list-decodable codes and average-case complexity, we obtain a new, more efficient, worst-case to average-case reduction for languages in EXP.
The Complexity of Local List Decoding
"... 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 computing majority over Θ(1/ǫ) bits is essentially equivalent to locally listdecoding binary codes from relative distance ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
efficient (in terms of circuit size and depth) local-decoder that uses majority gates of fan-in Θ(1/ǫ). Using known lower bounds for computing majority by constant depth circuits, our results imply that every constant-depth decoder for such a code must have size almost exponential in 1/ǫ (this extends even
Verifying and Decoding in Constant Depth Shafi Goldwasser *CSAIL, MIT and
"... Another, less immediate sender-receiver setting arises in considering error correcting codes. By taking the sender to be a (potentially corrupted) codeword and the receiver to be a decoder, we obtain explicit families of codes that are locally (list-)decodable by constant-depth circuits of size poly ..."
Abstract
- Add to MetaCart
Another, less immediate sender-receiver setting arises in considering error correcting codes. By taking the sender to be a (potentially corrupted) codeword and the receiver to be a decoder, we obtain explicit families of codes that are locally (list-)decodable by constant-depth circuits of size
Context Coding of Depth Map Images Under the Piecewise-Constant Image Model Representation
"... Abstract — This paper introduces an efficient method for loss-less compression of depth map images, using the representation of a depth image in terms of three entities: 1) the crack-edges; 2) the constant depth regions enclosed by them; and 3) the depth value over each region. The starting represen ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
, the vertical and horizontal crack-edges separating the constant depth regions are transmitted by 2D context coding using optimally pruned context trees. Both the encoder and decoder can reconstruct the regions of constant depth from the transmitted crack-edge image. The depth value in a given region is encoded
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
- ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 44 (2005)
, 2005
"... 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 the codeword. Polynomial Identity Testing (PIT) is one of the fundamental problems of algebraic complexity: we are given ..."
Abstract
-
Cited by 47 (14 self)
- Add to MetaCart
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 the codeword. Polynomial Identity Testing (PIT) is one of the fundamental problems of algebraic complexity: we are given
The complexity of constructing pseudorandom generators from hard functions
- COMPUTATIONAL COMPLEXITY
, 2004
"... We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f: {0, 1} l → {0, 1} computable in alternating time O(l) with O(1) alternations that is hard on average (i.e. there is a constant ..."
Abstract
-
Cited by 42 (9 self)
- Add to MetaCart
within the polynomial time hierarchy. These negative results are obtained by showing that polynomial-size constant-depth circuits cannot compute good extractors and list-decodable codes.
Cryptography with Constant Input Locality (Extended Abstract)
"... We study the following natural question: Which cryptographic primitives (if any) can be realized by functions with constant input locality, namely functions in which every bit of the input influences only a constant number of bits of the output? This continues the study of cryptography in low compl ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
generators, commitments, and semanticallysecure public-key encryption schemes whose input locality is constant. Moreover, these constructions also enjoy constant output locality. Therefore, they give rise to cryptographic hardware that has constant-depth, constant fan-in and constant fan-out. As a byproduct
Protecting Circuits from Computationally Bounded and Noisy Leakage ∗
, 2014
"... Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defined classes of leakage. Our construction requ ..."
Abstract
- Add to MetaCart
that the apparatus is limited in the amount of output bits per iteration and the ability to decode certain linear encodings. While our results apply in general to such leakage classes, in particular, we obtain security against: • Constant-depth circuits leakage, where the leakage function is computed by an AC 0
Bit Allocation and Encoded View Selection for Optimal Multiview Image Representation
"... Abstract—Novel coding tools have been proposed recently to encode texture and depth maps of multiview images, exploiting inter-view correlations, for depth-image-based rendering (DIBR). However, the important associated bit allocation problem for DIBR remains open: for chosen view coding and synthes ..."
Abstract
- Add to MetaCart
and synthesis tools, how to allocate bits among texture and depth maps across encoded views, so that the fidelity of a set of V views reconstructed at the decoder is maximized, for a fixed bitrate budget? In this paper, we present an optimization strategy to select subset of texture and depth maps
On Dependent Bit Allocation for Multiview Image Coding With Depth-Image-Based Rendering
, 2011
"... The encoding of both texture and depth maps of multiview images, captured by a set of spatially correlated cameras, is important for any 3-D visual communication system based on depth-image-based rendering (DIBR). In this paper, we address the problem of efficient bit allocation among texture and de ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
and depth maps of multiview images. More specifically, suppose we are given a coding tool to encode texture and depth maps at the encoder and a view-synthesis tool to construct intermediate views at the decoder using neighboring encoded texture and depth maps. Our goal is to determine how to best select
Results 1 - 10
of
46
