80 search results - page 15 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
TWC
2011
13 years 2 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
RSP
1999
IEEE
13 years 11 months ago
1999
IEEE
Though synchronous dataflow (SDF) graph has been a successful input specification language for digital signal processing (DSP) applications, lack of support for global states makes...
TCOM
2010
13 years 5 months ago
2010
—Receive antenna selection for unitary space-time modulation (USTM) over semi-correlated Ricean fading channels is analyzed (this work generalizes that of Ma and Tepedelenlio˘gl...
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
WAW
2004
Springer
14 years 23 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...