Sciweavers

263 search results - page 28 / 53
» Regret Bounds for Prediction Problems
Sort
View
EUROCOLT
1995
Springer
14 years 1 months ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
14 years 1 months ago
Mixing independent classifiers
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
Jan Drugowitsch, Alwyn Barry
MOC
2010
13 years 4 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li
ICC
2007
IEEE
107views Communications» more  ICC 2007»
14 years 4 months ago
Error Floors of LDPC Coded BICM
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
Aditya Ramamoorthy, Nedeljko Varnica
FM
2009
Springer
157views Formal Methods» more  FM 2009»
14 years 4 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...