68 search results - page 1 / 14 » Structured Low Rank Approximation of a Bezout Matrix |
MICS
2007
13 years 10 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
SIAMSC
2011
13 years 5 months ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
SCIA
2009
Springer
14 years 5 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
IDEAL
2010
Springer
13 years 8 months ago
2010
Springer
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...