Pages that link to "Item:Q861807"
From MaRDI portal
The following pages link to Random sampling of sparse trigonometric polynomials (Q861807):
Displayed 4 items.
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing (Q861809) (← links)
- Iterative thresholding algorithms (Q942154) (← links)
- Uncertainty in time-frequency representations on finite Abelian groups and applications (Q942155) (← links)
- On the properties of reachability, observability, controllability, and constructibility of discrete-time positive time-invariant linear systems with aperiodic choice of the sampling instants (Q2478387) (← links)