Sciweavers

641 search results - page 40 / 129
» On robust online scheduling algorithms
Sort
View
ICCCN
2007
IEEE
13 years 8 months ago
Online Selection of Tracking Features using AdaBoost
In this paper, a novel feature selection algorithm for object tracking is proposed. This algorithm performs more robust than the previous works by taking the correlation between f...
Ying-Jia Yeh, Chiou-Ting Hsu
IPL
2008
80views more  IPL 2008»
13 years 8 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
CVPR
2011
IEEE
12 years 11 months ago
Robust Tracking Using Local Sparse Appearance Model and K-Selection
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Baiyang Liu, junzhou Huang, Casimir Kulikowski, Li...
ANOR
2010
112views more  ANOR 2010»
13 years 6 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
ICC
2007
IEEE
143views Communications» more  ICC 2007»
14 years 2 months ago
A Stochastic Framework for Scheduling in Wireless Packet Access Networks
— We put forth a unified framework for downlink and uplink scheduling of multiple connections with diverse qualityof-service requirements, where each connection transmits using ...
Xin Wang, Georgios B. Giannakis