108 search results - page 8 / 22 » Spreading of Messages in Random Graphs |
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
LCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We argue that users in social networks are strategic in how they post and propagate information. We propose two models — greedy and courteous — and study information propagatio...