94 search results - page 13 / 19 » Markov Random Walk Representations with Continuous Distribut... |
TMC
2008
13 years 6 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
IJRR
2011
13 years 1 months ago
2011
Abstract People typically move and act under the constraints of an environment, making human behavior strongly place-dependent. Motion patterns, the places and the rates at which p...
WWW
2005
ACM
14 years 7 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
SDM
2009
SIAM
14 years 3 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 ...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...