Approximate sparse recovery: optimizing time and measurements
type: Item
instance of: scholarly article
zbMATH Open document ID: 1259.94024
DOI: 10.1137/100816705
author: Yi Li
author: Ely Porat
author: A. Gilbert
author: M. Strauss
published in: SIAM Journal on Computing
publication date: 2012-08-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/0912.0229
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 6064778
zbMATH Keywords: sparse approximation
zbMATH Keywords: sublinear algorithm
zbMATH Keywords: approximate sparse recovery
zbMATH Keywords: randomized approximation scheme
MaRDI profile type: Publication
OpenAlex ID: W1994521750
arXiv ID: 0912.0229
Recommended article: Approximate sparse recovery: optimizing time and measurements
Recommended article: Q5743471
Recommended article: Computable Performance Bounds on Sparse Recovery
Recommended article: Sparse recovery by reduced variance stochastic approximation
Recommended article: Sparse Approximation and Recovery by Greedy Algorithms
Recommended article: Sparse recovery from saturated measurements
Recommended article: Lower Bounds for Sparse Recovery
Recommended article: Sparse recovery from inaccurate saturated measurements
Recommended article: For-All Sparse Recovery in Near-Optimal Time
title: Approximate sparse recovery: optimizing time and measurements
description: scientific article; zbMATH DE number 6064778