1191 search results - page 2 / 239 » Completeness and Performance Of The APO Algorithm |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
JMLR
2010
13 years 17 days ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
CORR
2011
Springer
13 years 24 days ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
TASLP
2011
13 years 22 days ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
CONSTRAINTS
2011
13 years 24 days ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...