376 search results - page 7 / 76 » On the Advice Complexity of Online Problems |
111
click to vote
ALT
2005
Springer
15 years 8 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
61
Voted
KBS
2007
14 years 11 months ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
UAI
2004
15 years 1 months ago
2004
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
ICPR
2008
IEEE
16 years 25 days ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...