Cart
Create Account
Sign In
Collection:
We propose a new greedy sparse approximation algorithm, called SLS for {\\it Single L1 Selection}, that addresses a least-squares optimization problem under a cardinality constraint. The specificity and the increased efficiency of SLS originates from its s
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Videos in this product
A Greedy Sparse Approximation Algorithm Based On L1-Norm Selection Rules
We propose a new greedy sparse approximation algorithm, called SLS for {\it Single L1 Selection}, that addresses a least-squares optimization problem under a cardinality constraint. The specificity and the increased efficiency of SLS originates from its s