It is well known that sparse approximation problem is NP-hard under general dictionaries. Several algorithms have been devised and analyzed in the past ...
Feb 9, 2017 · Abstract:It is well known that sparse approximation problem is \textsf{NP}-hard under general dictionaries. Several algorithms have been ...
Feb 9, 2017 · It is well known that sparse approximation problem is NP-hard under general dictionaries. Several algorithms have been devised and analyzed in ...
Semantic Scholar extracted view of "Sparse approximation is provably hard under coherent dictionaries" by A. Çivril.
It is well known that sparse approximation problem is NP-hard under general dictionaries. Several algorithms have been devised and analyzed in the past ...
People also ask
What is sparse approximation problem?
What is sparse function approximation?
Sparse approximation is provably hard under coherent dictionaries. A Çivril. Journal of Computer and System Sciences 84, 32-43, 2017. 1, 2017. PATIKA: An ...
ABSTRACT. This paper discusses a new greedy algorithm for solving the sparse approximation problem over quasi-incoherent dictio- naries. These dictionaries ...
Sparse approximation is NP-hard to approximate within ( 1 − 1 e ) under differential objective function. · Our reduction is a simple extension of Feigeʼs Set- ...
SPARsE is NP-hard even to approximate within any factor [3, 8]. The intrinsic difficulty of the problem under this objective function prevents one from ...
For a given class of dictionaries, how does one design a fast algorithm which provably calculates a nearly-optimal sparse representation of an arbitrary input ...