Sciweavers

164 search results - page 8 / 33
» Linear Error Correcting Codes with Anytime Reliability
Sort
View
STACS
2010
Springer
14 years 2 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
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 2 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
CACM
2008
131views more  CACM 2008»
13 years 7 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
MIPS
2004
Springer
121views Multimedia» more  MIPS 2004»
14 years 1 months ago
Analysis of FEC Codes for Partially Reliable Media Broadcasting Schemes
With many multimedia delivery schemes a client does not necessarily receive a given media content entirely (e.g. router congestions can lead some information to be lost). Mechanism...
Christoph Neumann, Vincent Roca
ISCA
2011
IEEE
522views Hardware» more  ISCA 2011»
12 years 11 months ago
CPPC: correctable parity protected cache
Due to shrinking feature sizes processors are becoming more vulnerable to soft errors. Write-back caches are particularly vulnerable since they hold dirty data that do not exist i...
Mehrtash Manoochehri, Murali Annavaram, Michel Dub...