Sciweavers

29908 search results - page 366 / 5982
» On the complexity of communication complexity
Sort
View
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 7 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 6 months ago
Mutual Information of IID Complex Gaussian Signals on Block Rayleigh-faded Channels
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-...
Fredrik Rusek, Angel Lozano, Nihar Jindal
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin
CORR
2008
Springer
71views Education» more  CORR 2008»
15 years 6 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 6 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...