Frames generated by graphs
From MaRDI portal
Cites work
- An introduction to frames and Riesz bases
- Averaged numerically optimal dual frames for erasures
- Equal-norm tight frames with erasures
- Frame paths and error bounds for sigma-delta quantization
- Frames, graphs and erasures
- Graph spectra in computer science
- Grassmannian frames with applications to coding and communication
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Linearly connected sequences and spectrally optimal dual frames for erasures
- Necessary and sufficient conditions for discrete wavelet frames in \(\mathbb{C}^N\)
- Numerically and spectrally optimal dual frames in Hilbert spaces
- On spectrally optimal duals for r-erasures of frames generated by graphs
- Optimal dual frame pairs: a synergy with graph theory
- Optimal dual frames for erasures
- Optimal frames for erasures.
- Scalable frames
- Spectra of graphs
- The theory of multiresolution analysis frames and applications to filter banks
- Tight frames generated by a graph short-time Fourier transform
This page was built for publication: Frames generated by graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396472)