Sciweavers

1594 search results - page 226 / 319
» Fast Prediction on a Tree
Sort
View
COLT
2000
Springer
15 years 2 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh
INFOCOM
1999
IEEE
15 years 2 months ago
The Window Distribution of Idealized TCP Congestion Avoidance with Variable Packet Loss
Abstract--This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varie...
Archan Misra, Teunis J. Ott
MICCAI
1999
Springer
15 years 2 months ago
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
Xavier Pennec, Pascal Cachier, Nicholas Ayache
AUSAI
2006
Springer
15 years 1 months ago
Virtual Attribute Subsetting
Attribute subsetting is a meta-classification technique, based on learning multiple base-level classifiers on projections of the training data. In prior work with nearest-neighbour...
Michael Horton, R. Mike Cameron-Jones, Raymond Wil...
CG
2008
Springer
14 years 12 months ago
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
Rémi Coulom