Sciweavers

1245 search results - page 4 / 249
» Binary Sparse Coding
Sort
View
IWPC
1999
IEEE
13 years 10 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
ITCC
2003
IEEE
13 years 11 months ago
On Quaternary MacDonald Codes
This paper studies two families of codes over Z4, MacDonald codes of type α and type β. The torsion code, weight distribution, and Gray image properties are studied. Some intere...
Charles J. Colbourn, Manish K. Gupta
ECCV
2010
Springer
13 years 10 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
CORR
2004
Springer
102views Education» more  CORR 2004»
13 years 6 months ago
The asymptotic number of binary codes and binary matroids
: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
Marcel Wild
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 5 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, ...