Recommendations
Cites work
- Algebraic Signal Processing Theory: 1-D Nearest Neighbor Models
- Algebraic Signal Processing Theory: 1-D Space
- Algebraic signal processing theory: Cooley-Tukey-type algorithms for polynomial transforms based on induction
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
- Algebraic Signal Processing Theory: Foundation and 1-D Time
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Efficient Compression of QRS Complexes Using Hermite Expansion
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 4049531 (Why is no real title available?)
- scientific article; zbMATH DE number 54097 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- Multidimensional Rotations in Feature Selection
- Recursive structure of noncausal Gauss-Markov random fields
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- The Hermite transform-theory
Cited in
(7)- Optimal design of edge weights in transforming low-frequency graph signals into the spectral domain
- Discrete Signal Processing on Graphs
- Algebraic signal processing model based on Legendre polynomials
- Introduction to graph signal processing
- Graph signal processing on dynamic graphs based on temporal-attention product
- Frames for signal processing on Cayley graphs
- Computing observation weights for signal extraction and filtering
This page was built for publication: Signal processing on weighted line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358733)
