108 search results - page 18 / 22 » Spreading of Messages in Random Graphs |
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
DSN
2009
IEEE
14 years 2 months ago
2009
IEEE
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...