835 search results - page 100 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
ICPR
2008
IEEE
15 years 5 hour ago
2008
IEEE
Online Boosting is an effective incremental learning method which can update weak classifiers efficiently according to the object being trackedt. It is a promising technique for o...
CPAIOR
2006
Springer
14 years 2 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
OOPSLA
2007
Springer
14 years 5 months ago
2007
Springer
All high-performance production JVMs employ an adaptive strategy for program execution. Methods are first executed unoptimized and then an online profiling mechanism is used to ...
ICIAR
2009
Springer
14 years 3 months ago
2009
Springer
A self-adaptive Hidden Markov Model (SA-HMM) based framework is proposed for behavior recognition in this paper. In this model, if an unknown sequence cannot be classified into an...