335 search results - page 47 / 67 » Resolvent of large random graphs |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
JMLR
2010
13 years 6 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...