Sciweavers

1245 search results - page 89 / 249
» Binary Sparse Coding
Sort
View
110
Voted
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 2 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
136
Voted
AMC
2006
80views more  AMC 2006»
15 years 2 months ago
Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive defi...
Luca Bergamaschi, Angeles Martinez, Giorgio Pini
ICC
2007
IEEE
15 years 9 months ago
Robust Code Acquisition in the Presence of BOC Modulation for Future Galileo Receivers
— The problem of code acquisition for the Galileo system is investigated in this paper. The effect of non-ideal sampling on the Binary Offset Carrier (BOC) modulated signal is ev...
Marco Villanti, Claudio Palestini, Raffaella Pedon...
91
Voted
ICPR
2002
IEEE
15 years 7 months ago
Tree Pruning for Output Coded Ensembles
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
Terry Windeatt, Gholamreza Ardeshir
117
Voted
TIT
2002
78views more  TIT 2002»
15 years 2 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn