413 search results - page 40 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
112
click to vote
PODC
1999
ACM
15 years 6 months ago
1999
ACM
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
114
click to vote
ICIP
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...
159
click to vote
FORMATS
2010
Springer
15 years 7 days ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
119
click to vote
ACSD
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
189
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...