Login / Signup
Projection Onto The k-Cosparse Set is NP-Hard
Andreas M. Tillmann
Rémi Gribonval
Marc E. Pfetsch
Published in:
CoRR (2013)
Keyphrases
</>
np hard
probability distribution
set cover
initial set
special case
multiscale
databases
scheduling problem
small number
np complete
evolutionary algorithm
computational complexity
dynamic programming
input data
image set
integer programming
case study
learning algorithm