Sciweavers

13603 search results - page 150 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 3 months ago
Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO Communications
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
Petros Elia, Joakim Jalden
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 8 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
CODES
2006
IEEE
15 years 8 months ago
Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
Maarten Wiggers, Marco Bekooij, Pierre G. Jansen, ...
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 6 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
BMCBI
2008
111views more  BMCBI 2008»
15 years 6 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...