Sciweavers

Share
82 search results - page 1 / 17
» Information dissemination in highly dynamic graphs
Sort
View
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
10 years 4 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
ASUNAM
2011
IEEE
9 years 2 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
ALGORITHMICA
2011
9 years 9 months ago
On Dissemination Thresholds in Regular and Irregular Graph Classes
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques...
GC
2004
Springer
10 years 8 months ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
WMCSA
2002
IEEE
10 years 7 months ago
Context Aggregation and Dissemination in Ubiquitous Computing Systems
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
Guanling Chen, David Kotz
books