358 search results - page 21 / 72 » Rank Matrix Factorisation |
COCO
2009
Springer
15 years 5 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
168
click to vote
SIAMJO
2011
14 years 5 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
108
click to vote
TIT
2010
14 years 5 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...
APPML
2004
14 years 10 months ago
2004
In this paper, a new condition for the controllability of higher order linear dynamical systems is obtained. The suggested test contains rank conditions of suitably defined matric...
105
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: The construction of literature-based networks of gene-gene interactions is one of the most important applications of text mining in bioinformatics. Extracting potentia...