569 search results - page 25 / 114 » Online Bounds for Bayesian Algorithms |
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
SIAMCOMP
2008
14 years 9 months ago
2008
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
101
click to vote
ICALP
2011
Springer
14 years 1 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...