Sciweavers

2270 search results - page 121 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ATAL
2005
Springer
15 years 12 months ago
Data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
Filip Miletic, Patrick Dewilde
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
13 years 8 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
DSN
2005
IEEE
15 years 12 months ago
ADEPTS: Adaptive Intrusion Response Using Attack Graphs in an E-Commerce Environment
Distributed systems with multiple interacting services, such as distributed e-commerce systems, are suitable targets for malicious attacks because of the potential financial impac...
Bingrui Foo, Yu-Sung Wu, Yu-Chun Mao, Saurabh Bagc...
PODC
2012
ACM
13 years 8 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
PODC
2005
ACM
15 years 12 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer