2304 search results - page 211 / 461 » On the Vulnerability of Large Graphs |
204
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
201
click to vote
SC
2003
ACM
15 years 12 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...
147
click to vote
ECOOP
2006
Springer
15 years 10 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
159
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a power...
171
click to vote
DM
2008
15 years 6 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...