Mathematics in signal processing V
By Gerry Leversha. 2003
175 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/593629e4152f0fcd1bce4e868e7963c05c984cfc
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Mariya Ishteva
- S. Van Huffel
- Pierre-Antoine Absil
- J. M. Landsberg
- Lieven De Lathauwer
- Jaroslaw Buczy'nski
- Derya Soydaner
Citations in the corpus
- Differential-geometric Newton method for the best rank-(R1, R2, R3) approximation of tensors (2008, background): “In the literature, decompositions are considered where the tensor corresponding to S is as diagonal as possible (in a least squares sense) [8, 16, 36], or where the original tensor is decomposed in a minimal number of rank-1 terms (CANDECOMP/PARAFAC) [7, 9, 10, 17, 27], on which orthogonal constrain”
- On the third secant variety (2011, background): “siderable amount of recent research on ranks and border ranks of tensors, see, e.g., [15, 9] and references therein. In signal processing one is interested in determining ranks of tensors, see, e.g., [6] and references therein. In computational complexity, one looks for exotic algorithms via limits ”
- Riemannian Optimization on Tensor Products of Grassmann Manifolds: Applications to Generalized Rayleigh-Quotients (2010, background): “Classical application areas of such low-rank approximations can be found in statistics, signal processing and data compression [4, 20, 21, 31].”