Sciweavers

2750 search results - page 139 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
FLAIRS
2006
15 years 7 months ago
Robot Navigation Using Integrated Retrieval of Behaviors and Routes
RUPART1 is a hybrid robot control system for navigating a real-world, academic building. Hybrid robot control systems provide robust low-level navigation together with strategic p...
Susan Eileen Fox, Peter Anderson-Sprecher
ICML
2005
IEEE
16 years 7 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
15 years 11 months ago
Parametric Primitives for Motor Representation and Control
The use of motor primitives for the generation of complex movements is a relatively new and interesting idea for dimensionality reduction in robot control. We propose a framework ...
R. Amit, Maja J. Mataric
PRL
2011
15 years 1 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino