Sciweavers

11910 search results - page 117 / 2382
» Online Learning Algorithms
Sort
View
104
Voted
FOCS
1995
IEEE
15 years 4 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
ICML
2008
IEEE
16 years 1 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li
98
Voted
ICDAR
2009
IEEE
15 years 7 months ago
Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
Abdullah Almaksour, Éric Anquetil
ISWC
2003
IEEE
15 years 5 months ago
Unsupervised, Dynamic Identification of Physiological and Activity Context in Wearable Computing
Context-aware computing describes the situation where a wearable / mobile computer is aware of its user’s state and surroundings and modifies its behavior based on this informat...
Andreas Krause, Daniel P. Siewiorek, Asim Smailagi...
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 22 days ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner