Sciweavers

1612 search results - page 61 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
A Markov Random Field Model for Automatic Speech Recognition
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
Gérard Chollet, Guillaume Gravier, Marc Sig...
AAAI
1998
14 years 11 months ago
Boosting Combinatorial Search Through Randomization
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
Carla P. Gomes, Bart Selman, Henry A. Kautz
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
SAGA
2007
Springer
15 years 3 months ago
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
Artur Czumaj, Xin Wang
SPAA
2009
ACM
15 years 4 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski