108 search results - page 20 / 22 » Spreading of Messages in Random Graphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Electronic mail services have become an important source of communication for millions of people all over the world. Due to this tremendous growth, there has been a significant in...
PDCAT
2005
Springer
14 years 26 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...