A greedy algorithm to extract sparsity degree for ℓ1/ℓ0-equivalence in a deterministic context - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Nelly Pustelnik, Charles Dossal, Flavius Turcu, Yannick Berthoumieu, Philippe Ricoux. A greedy algorithm to extract sparsity degree for ℓ1/ℓ0-equivalence in a deterministic context. In Proceedings of the 20th European Signal Processing Conference, EUSIPCO 2012, Bucharest, Romania, August 27-31, 2012. pages 859-863, IEEE, 2012. [doi]

This author has not been identified. Look up 'Nelly Pustelnik' in GoogleThis author has not been identified. Look up 'Charles Dossal' in GoogleThis author has not been identified. Look up 'Flavius Turcu' in GoogleThis author has not been identified. Look up 'Yannick Berthoumieu' in GoogleThis author has not been identified. Look up 'Philippe Ricoux' in Google

runs on WebDSL