766 search results - page 1 / 154 » Online Variance Minimization |
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
EOR
2002
13 years 7 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
AAAI
2012
11 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise...