598 search results - page 52 / 120 » A random graph model for massive graphs |
188
click to vote
COMGEO
1999
ACM
15 years 5 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
189
click to vote
JMLR
2012
13 years 8 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
176
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
148
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
182
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...