Sciweavers

611 search results - page 89 / 123
» Random web crawls
Sort
View
CN
1998
81views more  CN 1998»
14 years 9 months ago
Improving the WWW: Caching or Multicast?
We consider two schemes for the distributionof Web documents. In the first scheme the sender repeatedly transmits the Web document into a multicast address, and receivers asynchr...
Pablo Rodriguez, Keith W. Ross, Ernst Biersack
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 4 months ago
Stochastic RED and Its Applications
Abstract— In this paper, we present a novel fair queue management algorithm called Stochastic RED (StoRED), inspired by the well known stochastic fair queuing and based on the ra...
Shan Chen, Zhen Zhou, Brahim Bensaou
CSFW
2002
IEEE
15 years 2 months ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
Vitaly Shmatikov
IM
2007
14 years 9 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen
WWW
2005
ACM
15 years 10 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...