Sciweavers

11910 search results - page 266 / 2382
» Online Learning Algorithms
Sort
View
COLT
1995
Springer
15 years 10 months ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ECCV
2008
Springer
16 years 8 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
ICRA
2007
IEEE
189views Robotics» more  ICRA 2007»
16 years 26 days ago
Context Estimation and Learning Control through Latent Variable Extraction: From discrete to continuous contexts
— Recent advances in machine learning and adaptive motor control have enabled efficient techniques for online learning of stationary plant dynamics and it’s use for robust pre...
Georgios Petkos, Sethu Vijayakumar
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
15 years 4 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
ATAL
2009
Springer
16 years 1 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh