856 search results - page 46 / 172 » On Randomness Measures for Social Networks. |
174
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
168
click to vote
MASCOTS
2007
15 years 7 months ago
2007
—Simulation methods have become an integral part of almost all aspects of networking research and particularly in the area of wireless networks. Any new protocol or methodology t...
141
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
161
click to vote
COMCOM
2006
15 years 6 months ago
2006
Several emerging large-scale Internet applications such as Content Distribution Networks, and Peerto-Peer networks could potentially benefit from knowing the underlying Internet t...
169
click to vote
USENIX
2008
15 years 8 months ago
2008
In this paper we present the analysis of two large-scale network file system workloads. We measured CIFS traffic for two enterprise-class file servers deployed in the NetApp data ...