Fractional covers for convolution products
From MaRDI portal
(Redirected from Fractional covers for convolution products)
Recommendations
- Covering numbers of \(L_{p}\)-balls of convex functions and sets
- Sample complexity of worst-case H^-identification
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
- scientific article; zbMATH DE number 3849250
- Convolution random sampling in multiply generated shift-invariant spaces of \(L^p(\mathbb{R}^d)\)
Cites work
- Interpolation in Normed Spaces from the Values of Linear Functionals
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- On the time complexity of worst-case system identification
- Probability Inequalities for Sums of Bounded Random Variables
- Robust identification of strongly stabilizable systems
- The sample complexity of worst-case identification of FIR linear systems
Cited in
(2)
This page was built for publication: Fractional covers for convolution products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923650)