53 search results - page 11 / 11 » Efficient Algorithms for Approximating Polygonal 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...
BMCBI
2010
13 years 3 months ago
2010
Background: The preprocessing of gene expression data obtained from several platforms routinely includes the aggregation of multiple raw signal intensities to one expression value...
UAI
2000
13 years 7 months ago
2000
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...