Sciweavers

1243 search results - page 13 / 249
» Complexity reduction of C-Algorithm
Sort
View
TCOM
2010
133views more  TCOM 2010»
14 years 4 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
COMPLEXITY
2010
129views more  COMPLEXITY 2010»
14 years 6 months ago
The notion of computation is fundamental to an autonomous neuroscience
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
Garrett Neske
ICASSP
2011
IEEE
14 years 1 months ago
Efficient lattice-reduction-aided MMSE decision-feedback equalization
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
Robert F. H. Fischer
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
15 years 1 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 1 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...