Sciweavers

2861 search results - page 118 / 573
» Parallel Online Learning
Sort
View
113
Voted
ALT
2008
Springer
16 years 12 days ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
ICAPR
2009
Springer
15 years 1 months ago
Online Improved Eigen Tracking
We present a novel predictive statistical framework to improve the performance of an Eigen Tracker which uses fast and efficient eigen space updates to learn new views of the obje...
Subarna Tripathi, Santanu Chaudhury, Sumantra Dutt...
163
Voted
ICCV
2007
IEEE
15 years 9 months ago
Co-Tracking Using Semi-Supervised Support Vector Machines
This paper treats tracking as a foreground/background classification problem and proposes an online semisupervised learning framework. Initialized with a small number of labeled ...
Feng Tang, Shane Brennan, Qi Zhao, Hai Tao
131
Voted
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 3 months ago
A parallel learning algorithm for text classification
Text classification is the process of classifying documents into predefined categories based on their content. Existing supervised learning algorithms to automatically classify te...
Canasai Kruengkrai, Chuleerat Jaruskulchai
OSDI
2008
ACM
16 years 3 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...