2270 search results - page 246 / 454 » On the distribution of eigenvalues of graphs |
209
click to vote
MOBIHOC
2002
ACM
16 years 6 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...
166
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
155
click to vote
IEEEPACT
2007
IEEE
16 years 26 days ago
2007
IEEE
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
159
click to vote
ICNP
2005
IEEE
16 years 4 days ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
199
click to vote
SC
2003
ACM
15 years 11 months ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...