453 search results - page 70 / 91 » Tight bounds for the partial-sums problem |
SIAMCO
2002
13 years 7 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
SAGA
2009
Springer
14 years 1 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
We consider the multi-class classification problem, based on vector observation sequences, where the conditional (given class observations) probability distributions for each class...