Join Our Newsletter

ICASSP

2011

IEEE

10 years 5 months ago
2011

IEEE

—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, ﬁnd a low-rank matrix consistent with the observations. There exist...

TIT

2010

10 years 8 months ago
2010

This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...

SIAMREV

2010

10 years 8 months ago
2010

The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...

SIAMMAX

2010

10 years 8 months ago
2010

The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...

SIAMMA

2010

10 years 8 months ago
2010

Let P be an r

SIAMCOMP

2010

10 years 8 months ago
2010

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...

JMLR

2010

10 years 8 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...

TCS

2011

10 years 8 months ago
2011

Abstract. We present the ﬁrst fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...

SIAMSC

2011

10 years 8 months ago
2011

Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...

SIAMJO

2011

10 years 8 months ago
2011

Many applications arising in a variety of ﬁelds can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...