641 search results - page 10 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
COLT
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
MICRO
2002
IEEE
15 years 2 months ago
2002
IEEE
A value’s degree of use—the number of dynamic uses of that value—provides the most essential information needed to optimize its communication. We present simulation results ...
94
Voted
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
109
click to vote
BMVC
2010
14 years 7 months ago
2010
In this paper, we propose a framework for predicting the performance of a vision algorithm given the input image or video so as to maximize the algorithm's ability to provide...