10988 search results - page 464 / 2198 » Algorithmic Folding Complexity |
147
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
162
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
159
Voted
TASLP
2010
15 years 1 months ago
2010
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
161
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
153
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...