Sciweavers

139 search results - page 22 / 28
» Numerical differentiation by radial basis functions approxim...
Sort
View
SIAMJO
2011
13 years 2 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
14 years 1 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
ICA
2010
Springer
13 years 8 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
IJON
2007
184views more  IJON 2007»
13 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
IJCNN
2000
IEEE
13 years 12 months ago
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
Richard E. Groff, Daniel E. Koditschek, Pramod P. ...