77 search results - page 8 / 16 » Sampling directed graphs with random walks |
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
WWW
2008
ACM
16 years 29 days ago
2008
ACM
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
115
click to vote
RSA
2011
14 years 7 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
113
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
105
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...