Sciweavers

Share
15 search results - page 2 / 3
» waw 2007
Sort
View
WAW
2007
Springer
96views Algorithms» more  WAW 2007»
10 years 7 months ago
Clustering Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that cl...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
10 years 7 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
10 years 7 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
10 years 7 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
10 years 7 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
books