33 search results - page 7 / 7 » Graph Matching using Adjacency Matrix Markov Chains |
WWW
2005
ACM
14 years 6 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
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 ...