12 search results - page 2 / 3 » Null space conditions and thresholds for rank minimization |
COMPUTING
2004
13 years 8 months ago
2004
In [1] Optimal Control methods over re-parametrization for curve and surface design were introduced. The advantage of Optimal Control over Global Minimization such as in [17] is t...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
SIAMJO
2011
12 years 11 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...