65 search results - page 10 / 13 » Mixing Time of Exponential Random Graphs |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
PODC
2010
ACM
14 years 14 days ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
VLSID
2006
IEEE
14 years 9 months ago
2006
IEEE
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
JMLR
2010
13 years 3 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...