Sciweavers

77 search results - page 4 / 16
» Probabilistic Communication Complexity Over The Reals
Sort
View
HICSS
2002
IEEE
98views Biometrics» more  HICSS 2002»
13 years 10 months ago
Growth and Propagation of Disturbances in a Communication Network Model
In a society in which information is one of the highest-valued commodities, information networks are the economic backbone. Therefore, network vulnerability is a major hazard. Ana...
David E. Newman, Nathaniel D. Sizemore, Vickie E. ...
JIRS
2008
100views more  JIRS 2008»
13 years 5 months ago
Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
Bostjan Potocnik, Gasper Music, Igor Skrjanc, Boru...
JSC
2010
155views more  JSC 2010»
13 years 4 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 12 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
SIAMCO
2010
147views more  SIAMCO 2010»
13 years 4 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri