Sciweavers

1245 search results - page 68 / 249
» Binary Sparse Coding
Sort
View
108
Voted
OSDI
2008
ACM
16 years 2 months ago
Binary Translation Using Peephole Superoptimizers
We present a new scheme for performing binary translation that produces code comparable to or better than existing binary translators with much less engineering effort. Instead of...
Sorav Bansal, Alex Aiken
IJSNET
2007
97views more  IJSNET 2007»
15 years 2 months ago
Stochastic binary sensor networks for noisy environments
— This paper proposes a stochastic framework for detecting anomalies or gathering interesting events in a noisy environment using a sensor network consisting of binary sensors. A...
T. Nguyen, Dong Nguyen, Huaping Liu, Duc A. Tran
TCOM
2008
63views more  TCOM 2008»
15 years 2 months ago
A general construction of constrained parity-check codes for optical recording
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
Kui Cai, Kees A. Schouhamer Immink
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 4 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
SPEECH
2011
14 years 9 months ago
Auditory-inspired sparse representation of audio signals
This article deals with the generation of auditory-inspired spectro-temporal features aimed at audio coding. To do so, we first generate sparse audio representations we call spik...
Ramin Pichevar, Hossein Najaf-Zadeh, Louis Thibaul...