394 search results - page 11 / 79 » Computing Minimal Polynomials of Matrices |
126
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
141
Voted
SMA
2008
ACM
15 years 2 months ago
2008
ACM
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
116
Voted
STOC
2010
ACM
16 years 10 hour ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
120
Voted
MP
2010
14 years 9 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
105
Voted
HYBRID
2004
Springer
15 years 8 months ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...