Sciweavers

292 search results - page 16 / 59
» Scaling properties of the Internet graph
Sort
View
IMC
2010
ACM
13 years 5 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
COCOON
2005
Springer
14 years 1 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
SIGCOMM
2006
ACM
14 years 1 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 8 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
WWW
2008
ACM
14 years 8 months ago
IRLbot: scaling to 6 billion pages and beyond
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...
Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmit...