569 search results - page 23 / 114 » Online Bounds for Bayesian Algorithms |
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
JMLR
2011
14 years 4 months ago
2011
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
JAIR
2010
14 years 8 months ago
2010
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
COR
2011
14 years 4 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...