Sciweavers

33 search results - page 5 / 7
» Tolerant Linearity Testing and Locally Testable Codes
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 6 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
VCIP
2001
159views Communications» more  VCIP 2001»
13 years 7 months ago
Embedded-to-lossless coding of motion-compensated prediction residuals in lossless video coding
Lossless video coding is useful in applications where no loss of information or visual quality is tolerable. In embedded to lossless coding an encoded video stream can be decoded ...
G. Charith K. Abhayaratne, Donald M. Monro
ECCV
2010
Springer
13 years 10 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
LCTRTS
2009
Springer
14 years 16 days ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava
IPPS
1998
IEEE
13 years 10 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...