2638 search results - page 120 / 528 » Random Geometric Complexes |
127
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
106
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
In a wide range of communication systems, including DS-CDMA and OFDM systems, the signal-of-interest might be corrupted by an improper [1] (also called non circularly symmetric [2...
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
160
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
163
click to vote
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...