364 search results - page 37 / 73 » Computing Communities in Large Networks Using Random Walks |
95
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we introduce a new scheme called SecureRank for prioritizing vulnerabilities to patch in computing systems/networks. This has become a key issue for IT infrastru...
116
Voted
DSN
2008
IEEE
15 years 9 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
125
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
139
Voted
IM
2007
15 years 2 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
142
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...