Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
We define strong r-similarity and the morphing distance to bound geometric distortions between shapes of equal topology. We then derive a necessary and sufficient condition for a ...
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
— The new theory of compressive sensing enables direct analog-to-information conversion of compressible signals at subNyquist acquisition rates. We develop new theory, algorithms...
Jason N. Laska, Sami Kirolos, Marco F. Duarte, Tam...