Sciweavers

108 search results - page 3 / 22
» A class of error-correcting pooling designs over complexes
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Learning Mid-Level Features For Recognition
Many successful models for scene or object recognition transform low-level descriptors (such as Gabor filter responses, or SIFT descriptors) into richer representations of interme...
Y-Lan Boureau, Francis Bach, Yann LeCun, Jean Ponc...
ISCA
2010
IEEE
199views Hardware» more  ISCA 2010»
13 years 9 months ago
Use ECP, not ECC, for hard failures in resistive memories
As leakage and other charge storage limitations begin to impair the scalability of DRAM, non-volatile resistive memories are being developed as a potential replacement. Unfortunat...
Stuart E. Schechter, Gabriel H. Loh, Karin Straus,...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 4 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...
QSHINE
2005
IEEE
13 years 11 months ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
CIE
2006
Springer
13 years 9 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler