Sciweavers

1245 search results - page 14 / 249
» Binary Sparse Coding
Sort
View
DCC
2001
IEEE
14 years 9 months ago
Binary Optimal Odd Formally Self-Dual Codes
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...
Koichi Betsumiya, Masaaki Harada
ICML
2010
IEEE
13 years 10 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 9 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
TIT
2008
82views more  TIT 2008»
13 years 9 months ago
ZRM Codes
Abstract. Quaternary Z RM (r,m) codes were defined to study the Z4-linearity of ReedMuller codes. In the literature two different definitions of such codes can be found, denoted Z ...
Joaquim Borges, Cristina Fernández-Có...
ICSE
2005
IEEE-ACM
14 years 9 months ago
Binary refactoring: improving code behind the scenes
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
Eli Tilevich, Yannis Smaragdakis