Sciweavers

181 search results - page 18 / 37
» On the Number of Errors Correctable with Codes on Graphs
Sort
View
SIGMETRICS
2011
ACM
178views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Soft error benchmarking of L2 caches with PARMA
The amount of charge stored in an SRAM cell shrinks rapidly with each technology generation thus increasingly exposing caches to soft errors. Benchmarking the FIT rate of caches d...
Jinho Suh, Mehrtash Manoochehri, Murali Annavaram,...
ICDAR
2009
IEEE
14 years 2 months ago
Shape Encoded Post Processing of Gurmukhi OCR
A post-processor is an integral part of any OCR system. This paper proposes a method for detection and correction of errors in recognition results of handwritten and machine print...
Dharam Veer Sharma, Gurpreet Singh Lehal, Sarita M...
CIARP
2008
Springer
13 years 9 months ago
Ensemble Approaches to Facial Action Unit Classification
Facial action unit (au) classification is an approach to face expression recognition that decouples the recognition of expression from individual actions. In this paper, upper face...
Terry Windeatt, Kaushala Dias
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 11 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...