L0 buffer energy optimization through scheduling and exploration
Abstract
References
- L0 buffer energy optimization through scheduling and exploration
Recommendations
Subspace Learning by $$\ell ^{0}$$ℓ0-Induced Sparsity
Subspace clustering methods partition the data that lie in or close to a union of subspaces in accordance with the subspace structure. Such methods with sparsity prior, such as sparse subspace clustering (SSC) (Elhamifar and Vidal in IEEE Trans Pattern ...
Image compressive sensing recovery using adaptively learned sparsifying basis via L0 minimization
From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of the ...
Multi-task l0 gradient minimization for visual tracking
In most object tracking algorithms based on sparse representation, the optimization problem is often formulated as an l1 or l2 minimization problem, because its primal l0-norm minimization problem is NP-hard. In this paper, a visual tracking method is ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/1d2941c0-f7a4-4227-b33a-cb651c383d83/967900.cover.jpg)
- Conference Chair:
- Hisham M. Haddad,
- Program Chairs:
- Andrea Omicini,
- Roger L. Wainwright,
- Publications Chair:
- Lorie M. Liebrock
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 153Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in