Sciweavers

654 search results - page 97 / 131
» TRUST-TECH based Methods for Optimization and Learning
Sort
View
133
Voted
IROS
2009
IEEE
138views Robotics» more  IROS 2009»
15 years 7 months ago
Using eigenposes for lossless periodic human motion imitation
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...
Rawichote Chalodhorn, Rajesh P. N. Rao
100
Voted
ECML
2005
Springer
15 years 6 months ago
Kernel Basis Pursuit
ABSTRACT. Estimating a non-uniformly sampled function from a set of learning points is a classical regression problem. Kernel methods have been widely used in this context, but eve...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
SIGIR
2011
ACM
14 years 3 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
138
Voted
SYNTHESE
2008
84views more  SYNTHESE 2008»
15 years 17 days ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
112
Voted
PAMI
2011
14 years 7 months ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos