Sciweavers

598 search results - page 24 / 120
» A random graph model for massive graphs
Sort
View
ICALP
2009
Springer
14 years 5 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
PERCOM
2005
ACM
14 years 10 months ago
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
Sven Bittner, Wolf-Ulrich Raffel, Manuel Scholz
CAAN
2004
Springer
14 years 4 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
ICPR
2008
IEEE
14 years 5 months ago
Alternative similarity functions for graph kernels
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
Jérôme Kunegis, Andreas Lommatzsch, C...
CVPR
2004
IEEE
15 years 29 days ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...