24 search results - page 2 / 5 » On the Generalization Ability of Online Strongly Convex Prog... |
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
SAGT
2010
Springer
13 years 2 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
WAOA
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
CVPR
2011
IEEE
12 years 8 months ago
2011
IEEE
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
ISSTA
2009
ACM
13 years 11 months ago
2009
ACM
Atomicity is a key correctness specification for multithreaded programs. Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed...