Nearly-Optimal Bounds for Sparse Recovery in Generic Norms, With Applications to K-Median Sketching

doi 10.1137/1.9781611974331.ch24
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

(Nearly) Sample-Optimal Sparse Fourier Transform

2013English

Sublinear Time, Measurement-Optimal, Sparse Recovery for All

2012English

Bounds for Nearly Best Approximations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Geometric Median in Nearly Linear Time

2016English

Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2015English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Linear Time Bounds for Median Computations

1972English

Efficient Software Implementation of the Nearly Optimal Sparse Fast Fourier Transform for the Noisy Case

Ingeniería y Ciencia
2015English

Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy