Sciweavers

44 search results - page 5 / 9
» Learning and Approximating the Optimal Strategy to Commit To
Sort
View
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 2 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
NIPS
1998
13 years 9 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini
ICRA
2006
IEEE
165views Robotics» more  ICRA 2006»
14 years 1 months ago
Biped Gait Optimization using Spline Function based Probability Model
— A new Estimation of Distribution Algorithm (EDA) with spline kernel function (EDA_S) is proposed to optimize biped gait for a nine-link humanoid robot. Gait synthesis of the bi...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
ICCV
2007
IEEE
14 years 9 months ago
Boosting Invariance and Efficiency in Supervised Learning
In this paper we present a novel boosting algorithm for supervised learning that incorporates invariance to data transformations and has high generalization capabilities. While on...
Andrea Vedaldi, Paolo Favaro, Enrico Grisan