265 search results - page 20 / 53 » Generating an Assortative Network with a Given Degree Distri... |
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
RR
2007
Springer
14 years 2 months ago
2007
Springer
Modern semantic technology is one of the necessary supports for the infrastructure of next generation information systems. In particular, large international organizations, which u...
SIGMETRICS
2005
ACM
14 years 2 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
SECON
2007
IEEE
14 years 2 months ago
2007
IEEE
—We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor cov...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...