Recovery Guarantee of Sparse Binary Sensing Matrices under Greedy Algorithm.
Wen-Yao ChenChung-Chin LuPublished in: ISITA (2018)
Keyphrases
- greedy algorithm
- approximation guarantees
- sparse matrix
- binary matrices
- sparse matrices
- coefficient matrix
- greedy algorithms
- worst case
- set cover
- objective function
- sparse representation
- dynamic programming
- influence maximization
- greedy strategy
- greedy heuristic
- knapsack problem
- binary matrix
- singular value decomposition
- randomized algorithm
- approximation ratio
- structured sparsity
- submodular functions
- upper bound
- high dimensional