394 search results - page 10 / 79 » Computing Minimal Polynomials of Matrices |
JSC
1998
15 years 3 days ago
1998
The nearest singular polynomials to a given polynomial have been studied in [1], based on minimization of quadratic forms. An equivalent expression of the quadratic form is present...
105
click to vote
AUTOMATICA
2008
15 years 17 days ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
91
Voted
SIAMJO
2010
14 years 10 months ago
2010
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
121
Voted
JMLR
2010
14 years 7 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
94
Voted
ICDM
2005
IEEE
15 years 6 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...