412 search results - page 13 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
108
Voted
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
118
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
A novel framework for spatially estimating unknown image data is presented. Common applications include inpainting, concealment of transmission errors, prediction in video coding,...
AMT
2006
Springer
15 years 3 months ago
2006
Springer
In high-tech industries, most manufacturing processes are complexly intertwined, in that manufacturers or engineers can hardly control a whole set of processes. They are only capa...
102
click to vote
ML
2000
ACM
14 years 11 months ago
2000
ACM
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...