Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DAGSTUHL
2006

favoriteEmaildiscussreport

111views Software Engineering» more DAGSTUHL 2006»

Local Minimax Learning of Approximately Polynomial Functions

13 years 6 months ago

Local Minimax Learning of Approximately Polynomial Functions

Download drops.dagstuhl.de

Lee Jones, Konstantin A. Rybnikov

Real-time Traffic

DAGSTUHL 2006 | DAGSTUHL 2007 |

claim paper

Related Content

» Learning in Gibbsian Fields How Accurate and How Fast Can It Be

» Polynomial Regression with Automated Degree A Function Approximator for Autonomous Agents

» Local distance functions A taxonomy new algorithms and an evaluation

» Nonparametric Estimation of Transfer Functions Rates of Convergence and Adaptation

» Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions

» Value Function Approximation in Reinforcement Learning Using the Fourier Basis

» Local hybrid approximation for scattered data fitting with bivariate splines

» A study on polynomial regression and Gaussian process global surrogate model in hierarchic...

» Global Versus Local Constructive Function Approximation for OnLine Reinforcement Learning

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	DAGSTUHL
Authors	Lee Jones, Konstantin A. Rybnikov

Comments (0)