DataCite
metadata only
Algorithmic aspects of sparse approximations
Typical tasks in signal processing may be done in simpler ways or more efficiently if the signals to analyze are represented in a proper way. This thesis deals with some algorithmic problems related to signal approximation, more precisely, in the novel field of sparse approximation using redundant d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Uniform algebraic approximation of shift and multiplication operators#490009
- On homogeneous and self-dual algorithms for LCP#429973
- Volume Sampling and Spectral Equalization in Randomized Alternating Projections#1249770
- Invitation to the Second Symposium on Problems in the Optimization of Data Communications Systems#131380
- Consistency of Lloyd's Algorithm Under Perturbations#174013
Record · ID 1353464
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive