Sublinear-time algorithms recover k-sparse signals under Jacobi polynomial orthogonal transforms by reducing to 1-sparse recovery under a sparsity structure assumption.
Chebyshev polynomials in tcs and algorithm design.http://www.cameronmusco.com/personal_site/pdfs/retreatTalk.pdf
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sparse Recovery for Orthogonal Polynomial Transforms
Sublinear-time algorithms recover k-sparse signals under Jacobi polynomial orthogonal transforms by reducing to 1-sparse recovery under a sparsity structure assumption.