394 search results - page 8 / 79 » Computing Minimal Polynomials of Matrices |
ICPR
2000
IEEE
15 years 1 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In this paper we propose non-regenerative multicarrier multiple-input multiple-output (MIMO) relay techniques that minimize the mean-squared error (MSE) of the signal wa...
TCS
2008
14 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...