Sciweavers

1310 search results - page 47 / 262
» On a Class of Traceability Codes
Sort
View
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
PAMI
2008
155views more  PAMI 2008»
13 years 7 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
METRICS
1997
IEEE
13 years 12 months ago
Inheritance Tree Shapes and Reuse
The shapes of forests of inheritance trees can affect the amount of code reuse in an object-oriented system. Designers can benefit from knowing how structuring decisions affect r...
Byung-Kyoo Kang, James M. Bieman
ICASSP
2009
IEEE
14 years 2 months ago
Adaptive coding of images via multiresolution ICA
Multiresolution (MR) representations have been very successful in image encoding, due to both their algorithmic performance and coding efficiency. However these transforms are ...
Doru-Cristian Balcan, Michael S. Lewicki
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...