Sciweavers

110 search results - page 20 / 22
» Locally Decodable Quantum Codes
Sort
View
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
14 years 2 months ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
STACS
2010
Springer
14 years 4 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 9 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICC
2008
IEEE
175views Communications» more  ICC 2008»
14 years 3 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...