Sciweavers

2005 search results - page 272 / 401
» Decisive Markov Chains
Sort
View
ICML
2002
IEEE
16 years 2 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
122
Voted
WWW
2005
ACM
16 years 2 months ago
A uniform approach to accelerated PageRank computation
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...
Frank McSherry
WWW
2005
ACM
16 years 2 months ago
TotalRank: ranking without damping
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...
Paolo Boldi
WWW
2005
ACM
16 years 2 months ago
TruRank: taking PageRank to the limit
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
Sebastiano Vigna
CHI
2006
ACM
16 years 2 months ago
Quantifying interpersonal influence in face-to-face conversations based on visual attention patterns
A novel measure for automatically quantifying the amount of interpersonal influence present in face-toface conversations is proposed based on the visualattention patterns of the p...
Kazuhiro Otsuka, Junji Yamato, Yoshinao Takemae, H...