搜索结果: 1-8 共查到“信息科学与系统科学 Complexity”相关记录8条 . 查询时间(0.156 秒)
Communication Complexity and Coordination by Authority
Authority Complexity and Coordination
2015/7/31
We prove that the simplest communication allowing two players to coordinate on a course
of action is authority (letting one player choose an action). We also consider the case where
each player poss...
Conditional Kolmogorov Complexity and Universal Probability
Conditional Kolmogorov Complexity Universal Probability Information Theory
2012/6/21
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discr...
An Adaptive Conditional Zero-Forcing Decoder with Full-diversity, Least Complexity and Essentially-ML Performance for STBCs
Adaptive Conditional Zero-Forcing Decoder Full-diversity Essentially-ML Performance STBCs
2012/5/24
A low complexity, essentially-ML decoding technique for the Golden code and the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the de...
Permutation Complexity and Coupling Measures in Hidden Markov Models
Permutation Complexity Coupling Measures Hidden Markov Models Chaotic Dynamics
2012/4/26
In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 1370-1377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the relationship between ...
Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity
SNR-gap subexponential complexity Information Theory
2011/9/15
Abstract: The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-p...
Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
nonlinear function LDGM codes lossy compression replica method
2011/8/30
Abstract: A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryl...
The entropy functional, the information path functional's essentials and their connections to Kolmogorov's entropy, complexity and physics
Additive functional Entropy Singularities Natural Border Problem Invariant
2011/8/31
Abstract: The paper introduces the recent results related to an entropy functional on trajectories of a controlled diffusion process, and the information path functional (IPF), analyzing their connect...
Complexity Analysis and Computation of the Optimal Harvesting for One-Species Population Resources
2007/8/7
The exploitation of renewable resources creates many complex problems for culture, ecology and economics as well. Ascertaining the essentials behind the complex problems is very important. In this pap...