Sciweavers

14 search results - page 1 / 3
» Width-Bounded Reducibility and Binary Search over Complexity...
Sort
View
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
13 years 9 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 4 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...
TWC
2008
120views more  TWC 2008»
13 years 4 months ago
Binary Power Control for Sum Rate Maximization over Multiple Interfering Links
We consider allocating the transmit powers for a wireless multi-link (N-link) system, in order to maximize the total system throughput under interference and noise impairments, and...
Anders Gjendemsjø, David Gesbert, Geir E. &...
CVPR
2009
IEEE
14 years 11 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 2 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca