412 search results - page 2 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
202
click to vote
ALT
1999
Springer
15 years 10 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
142
click to vote
TIT
2002
15 years 5 months ago
2002
We consider the problem of sequential linear prediction of real-valued sequences under the square-error loss function. For this problem, a prediction algorithm has been demonstrate...
189
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper, we derive and evaluate theoretical ratedistortion performance bounds for scalable video compression algorithms which use a single motion-compensated prediction (MCP...
170
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
151
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
This paper presents a prediction algorithm for estimating the upper bound of future Web traffic volume. Unlike traditional traffic predictions that are performed at a single time ...