Sciweavers

83 search results - page 14 / 17
» A Unifying Polyhedral Approximation Framework for Convex Opt...
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ICCV
2007
IEEE
14 years 10 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ECCV
2004
Springer
14 years 9 months ago
Variational Pairing of Image Segmentation and Blind Restoration
Abstract. Segmentation and blind restoration are both classical problems, that are known to be difficult and have attracted major research efforts. This paper shows that the two pr...
Leah Bar, Nir A. Sochen, Nahum Kiryati
ICML
2009
IEEE
14 years 8 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
ICML
2007
IEEE
14 years 8 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji