835 search results - page 40 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
201
click to vote
IOR
2011
15 years 27 days ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
153
click to vote
SAGT
2010
Springer
15 years 4 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...
163
click to vote
ORDER
2007
15 years 5 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
131
click to vote
ICMCS
2006
IEEE
15 years 12 months ago
2006
IEEE
This paper addresses the problem of doubletalk detector calibration for acoustic echo cancellers in hands-free environments such as videoconferencing. A statistical model of a rec...
179
click to vote
NIPS
2001
15 years 7 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...