Sciweavers

2802 search results - page 252 / 561
» Online Learning with Kernels
Sort
View
ICML
2006
IEEE
16 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
IADIS
2008
15 years 8 months ago
The Pilot Implementation Of The Eit (English For Information Technology) E-Learning Portal
This paper presents the pilot implementation of the EIT (English for Information Technology) E-Learning Portal. The portal provides on-line e-learning material for English learnin...
Vilte Gridasova, Alina Ivanovaite, Philippos Pouyi...
TSMC
1998
99views more  TSMC 1998»
15 years 7 months ago
Learning visually guided grasping: a test case in sensorimotor learning
Abstract—We present a general scheme for learning sensorimotor tasks which allows rapid on-line learning and generalization of the learned knowledge to unfamiliar objects. The sc...
Ishay Kamon, Tamar Flash, Shimon Edelman
IROS
2008
IEEE
191views Robotics» more  IROS 2008»
16 years 1 months ago
Local Gaussian process regression for real-time model-based robot control
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
Duy Nguyen-Tuong, Jan Peters
COCOON
2007
Springer
16 years 1 months ago
Dimension, Halfspaces, and the Density of Hard Sets
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
Ryan C. Harkins, John M. Hitchcock