7129 search results - page 1216 / 1426 » Approximation Algorithms for Treewidth |
129
click to vote
WWW
2005
ACM
16 years 3 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...
110
click to vote
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
120
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
KDD
2005
ACM
16 years 3 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
125
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...