Sciweavers

1245 search results - page 2 / 249
» Binary Sparse Coding
Sort
View
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 6 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
IJON
2006
189views more  IJON 2006»
13 years 6 months ago
Storing and restoring visual input with collaborative rank coding and associative memory
Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing s...
Martin Rehn, Friedrich T. Sommer
CPHYSICS
2007
222views more  CPHYSICS 2007»
13 years 6 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 6 months ago
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes
Abstract-- We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function wh...
Shrinivas Kudekar, Rüdiger L. Urbanke
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
14 years 1 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan