5183 search results - page 55 / 1037 » The Complexity of Distributions |
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...
130
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
148
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
102
click to vote
COLING
2008
15 years 5 months ago
2008
We study the self-organization of the consonant inventories through a complex network approach. We observe that the distribution of occurrence as well as cooccurrence of the conso...
135
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— Inspired by the universal laws governing different kinds of complex networks, we propose a scale-free highlyclustered echo state network (SHESN). Different from echo state netw...