Login / Signup
A greedy algorithm to extract sparsity degree for ℓ1/ℓ0-equivalence in a deterministic context.
Nelly Pustelnik
Charles Dossal
Flavius Turcu
Yannick Berthoumieu
Philippe Ricoux
Published in:
EUSIPCO (2012)
Keyphrases
</>
greedy algorithm
greedy algorithms
randomized algorithm
set cover
objective function
approximation guarantees
greedy strategy
worst case
knapsack problem
dynamic programming
submodular functions
influence maximization
computational complexity
website
sparse representation
upper bound
affinity graph