Uniform approximation of vectors using adaptive randomized information
From MaRDI portal
Cites work
- Compressed sensing and best \(k\)-term approximation
- Finding frequent items in data streams
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Homogeneous algorithms and solvable problems on cones
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- Improved algorithms for adaptive compressed sensing
- Lower bounds for adaptive sparse recovery
- Lower bounds for the complexity of Monte Carlo function approximation
- On low-risk heavy hitters and sparse recovery schemes
- On the power of adaption
- On the Power of Adaptivity in Sparse Recovery
- Random approximation of Sobolev embeddings
- Randomized approximation of summable sequences -- adaptive and non-adaptive
- Randomized complexity of mean computation and the adaption problem
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
- Randomized complexity of vector-valued approximation
- Solvable integration problems and optimal sample size selection
Cited in
(2)
This page was built for publication: Uniform approximation of vectors using adaptive randomized information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892267)
