Sciweavers

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

70

Voted

NECO
2002

favoriteEmaildiscussreport

88views more NECO 2002»

Approximation Bounds for Some Sparse Kernel Regression Algorithms

14 years 9 months ago

Approximation Bounds for Some Sparse Kernel Regression Algorithms

Download stat.rutgers.edu

Tong Zhang

Real-time Traffic

NECO 2002 |

claim paper

Related Content

» Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kerne...

» Sparse approximation through boosting for learning large scale kernel machines

» Sparse multiscale gaussian process regression

» Kernel Polytope Faces Pursuit

» Kernel Density Construction Using Orthogonal Forward Regression

» Ridgelet kernel regression

» Random Features for LargeScale Kernel Machines

» Analysis of SVM regression bounds for variable ranking

» Coresets sparse greedy approximation and the FrankWolfe algorithm

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	NECO
Authors	Tong Zhang

Comments (0)