865 search results - page 108 / 173 » Random graph models for the web graph |
131
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
141
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
134
click to vote
MASCOTS
2003
15 years 5 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
143
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
130
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...