Sciweavers

181 search results - page 20 / 37
» Online promise problems with online width metrics
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
A robust boosting tracker with minimum error bound in a co-training framework
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
Rong Liu, Jian Cheng, Hanqing Lu
ECML
2007
Springer
13 years 11 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
AAAI
2007
13 years 10 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
DEDS
2010
88views more  DEDS 2010»
13 years 7 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
ICCV
2007
IEEE
14 years 9 months ago
Robust Visual Tracking Based on Incremental Tensor Subspace Learning
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...