Sciweavers

865 search results - page 33 / 173
» Random graph models for the web graph
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 7 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 8 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
ICALP
2009
Springer
14 years 3 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
TMM
2010
249views Management» more  TMM 2010»
13 years 3 months ago
Bridging the Semantic Gap Between Image Contents and Tags
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
Hao Ma, Jianke Zhu, Michael R. Lyu, Irwin King
ICDAR
2003
IEEE
14 years 1 months ago
Classification of Web Documents Using a Graph Model
In this paper we describe work relating to classification of web documents using a graph-based model instead of the traditional vector-based model for document representation. We ...
Adam Schenker, Mark Last, Horst Bunke, Abraham Kan...