439 search results - page 3 / 88 » An Improved Analysis of Linear Mergers |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A new theoretical framework for the analysis of linear combiners is presented in this paper. This framework extends the scope of previous analytical models, and provides ...
TIT
2008
13 years 7 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
ICPR
2002
IEEE
14 years 9 days ago
2002
IEEE
In this paper, a framework for the analysis of the error-reject trade-off in linearly combined classifiers is proposed. We start from a framework developed by Tumer and Ghosh [1,2...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...