Sciweavers

450 search results - page 44 / 90
» Satisfiability with Exponential Families
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 12 months ago
Coding over an Erasure Channel with a Large Alphabet Size
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
KI
2006
Springer
14 years 11 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
APIN
1998
98views more  APIN 1998»
14 years 11 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross
SIAMCO
2010
201views more  SIAMCO 2010»
14 years 6 months ago
Analysis of Unconstrained Nonlinear MPC Schemes with Time Varying Control Horizon
For discrete time nonlinear systems satisfying an exponential or finite time controllability assumption, we present an analytical formula for a suboptimality estimate for model pre...
Lars Grüne, Jürgen Pannek, Martin Seehaf...
ICASSP
2011
IEEE
14 years 3 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan