Sciweavers

1109 search results - page 136 / 222
» Crawling on web graphs
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
15 years 7 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
16 years 7 months ago
On Signatures for Communication Graphs
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua...
ICDE
2002
IEEE
117views Database» more  ICDE 2002»
16 years 7 months ago
Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement in Transcoding Proxies
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple ver...
Cheng-Yue Chang, Ming-Syan Chen
SAC
2010
ACM
16 years 1 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
16 years 15 days ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002