Sciweavers

824 search results - page 112 / 165
» Weighted Low-Rank Approximations
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Fast multiple instance learning via L1, 2 logistic regression
In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 and L2 regularisation techniques. An L1 regularised logistic regr...
Zhouyu Fu, Antonio Robles-Kelly
ICRA
2008
IEEE
169views Robotics» more  ICRA 2008»
15 years 4 months ago
Sparse incremental learning for interactive robot control policy estimation
— We are interested in transferring control policies for arbitrary tasks from a human to a robot. Using interactive demonstration via teloperation as our transfer scenario, we ca...
Daniel H. Grollman, Odest Chadwicke Jenkins
ICRA
2007
IEEE
127views Robotics» more  ICRA 2007»
15 years 4 months ago
A Dynamic Programming Approach to Redundancy Resolution with Multiple Criteria
— This paper addresses the problem of generating optimal joint trajectories for redundant manipulators when multiple criteria are to be considered. A dynamic programming approach...
A. Guigue, Mojtaba Ahmadi, M. J. D. Hayes, R. Lang...
MFCS
2007
Springer
15 years 3 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 3 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...