68 search results - page 4 / 14 » Structured Low Rank Approximation of a Bezout Matrix |
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
TSP
2008
13 years 6 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
SIAMMAX
2010
13 years 1 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE