Search
Now showing items 1-3 of 3
Parameterized Complexity of k-SPARSE problems
(2016)
Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...
Parameterized Complexity of k-SPARSE problems
(2016)
Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...
Parameterized Complexity of k-SPARSE problems
(2016)
Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...