Sciweavers

118 search results - page 9 / 24
» Some Results on Generalized Coherence of Conditional Probabi...
Sort
View
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 3 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
78
Voted
LICS
2000
IEEE
15 years 2 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
CISS
2011
IEEE
14 years 1 months ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...
70
Voted
TIT
2002
129views more  TIT 2002»
14 years 9 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang