Sciweavers

1147 search results - page 68 / 230
» Termination in language-based systems
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Joint estimation of channel and carrier frequency offset from the emitter, in an uplink OFDMA system
In this paper, we propose a joint estimation method of carrier frequency offsets (CFO) and channel impulse responses (CIR) for an uplink OFDMA system. We consider the CFOs come in...
Babar Aziz, Inbar Fijalkow, Myriam Ariaudo
RTA
2010
Springer
14 years 1 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
QEST
2008
IEEE
14 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ICAC
2007
IEEE
14 years 4 months ago
Towards Autonomic Fault Recovery in System-S
System-S is a stream processing infrastructure which enables program fragments to be distributed and connected to form complex applications. There may be potentially tens of thous...
Gabriela Jacques-Silva, Jim Challenger, Lou Degena...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 7 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski