搜索结果: 46-60 共查到“知识库 理学 Complexity”相关记录121条 . 查询时间(0.105 秒)
Duality Gap, Computational Complexity and NP Completeness: A Survey
Duality Gap Computational Complexity NP Completeness
2011/2/28
In this paper, we survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimizatio...
The subword complexity of smooth words on 2-letter alphabets
Derivative height smooth word LFE word
2011/2/21
Let a,b(n) be the number of smooth words of length n over the alphabet {a, b} with a < b. Say that a smooth word w is left fully extendable (LFE) if both aw and bw are smooth.
A measure of statistical complexity based on predictive information
measure of statistical complexity predictive information
2011/1/19
We introduce an information theoretic measure of statistical structure, called ‘binding informa-tion’, for sets of random variables, and compare it with several previously proposed measures in-cluding...
The Complexity of Approximately Counting Stable Roommate Assignments
Complexity of Approximately Stable Roommate Assignments
2011/3/2
We investigate the complexity of approximately counting stable room-mate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preferen...
Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol
Low-Complexity Dynamic Decode-and-Forward Relay Protocol
2011/1/17
The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme
which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tra...
Pair-wise Markov Random Fields Applied to the Design of Low Complexity MIMO Detectors
Pair-wise Markov Random Fields Design Low Complexity MIMO Detectors
2010/11/24
Pair-wise Markov random fields (MRF) are considered for application to the development of low complexity, iterative MIMO detection. Specifically, we consider two types of MRF, namely, the fully-conne...
Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms
Higher-order Fourier analysis linear forms
2010/11/24
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degre...
Orientable closed 3-manifolds with surface-complexity one
3-manifolds surface-complexity one
2010/11/23
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
Complexity, information transfer and collective behavior in chaotic dynamical networks
Chaotic Dynamics (nlin.CD) Adaptation and Self-Organizing Systems (nlin.AO)
2010/11/10
We investigate the relationship between complexity, information transfer and the emergence of collective behaviors, such as synchronization and nontrivial collective behavior, in a network of globally...
Quantum query complexity of minor-closed graph properties
Quantum query minor-closed graph properties
2010/11/8
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length....
Overcoming Problems in the Measurement of Biological Complexity
Overcoming Problems Measurement Biological Complexity
2010/11/10
In a genetic algorithm, fluctuations of the entropy of a genome over time are interpreted as fluctuations of the information that the genome's organism is storing about its environment, being this ref...
Aging is a fundamental aspect of living systems that undergo a progressive deterioration of physiological function with age and an increase of vulnerability to disease and death. Living systems, know...
Complexity Adjusted Soft-Output Sphere Decoding by Adaptive LLR Clipping
Soft-Output Sphere Decoding Adaptive LLR Clipping
2010/11/15
A-posteriori probability (APP) receivers operating over multiple-input, multiple-output channels provide enhanced performance at the cost of increased complexity. However, employing full APP processi...
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
Throughput Randomized Linear Network Coding
2010/11/22
To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all content blocks, bu...
Quantum Commitments from Complexity Assumptions
Quantum Commitments Complexity Assumptions
2010/11/5
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at computationally secu...