569 search results - page 8 / 114 » Online Bounds for Bayesian Algorithms |
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
IPL
2006
14 years 9 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
JMLR
2011
14 years 4 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...