Sciweavers

3809 search results - page 360 / 762
» Randomized Broadcast in Networks
Sort
View
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 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
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
16 years 1 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
15 years 12 months ago
Modular petri net based modeling, analysis and synthesis of dedicated production systems
−−−− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decompose...
George J. Tsinarakis, Kimon P. Valavanis, Nikos Ts...
ISCAS
2005
IEEE
119views Hardware» more  ISCAS 2005»
16 years 7 days ago
Stroboscopic model and bifurcations in TCP/RED
Abstract— In this paper, we derive a simple first-order discretetime model for the Transmission Control Protocol (TCP) with Random Early Detection (RED). We view the network as ...
Mingjian Liu, Hui Zhang, Ljiljana Trajkovic
EUROCRYPT
1998
Springer
15 years 11 months ago
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. However, prior to the results presented here, there ap...
Victor Shoup, Rosario Gennaro