1245 search results - page 20 / 249 » Binary Sparse Coding |
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
NECO
2008
13 years 9 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
WCC
2005
Springer
14 years 3 months ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
A key problem in using the output of an auditory model as the input to a machine-learning system in a machine-hearing application is to find a good feature-extraction layer. For ...