Sciweavers

394 search results - page 41 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
CVPR
2011
IEEE
14 years 8 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
105
Voted
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 18 days ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
TSMC
2008
136views more  TSMC 2008»
15 years 12 days ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 4 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
106
Voted
IOR
2008
104views more  IOR 2008»
15 years 15 days ago
Arrival Rate Approximation by Nonnegative Cubic Splines
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, G&...