( en | de | ru )

 

Disambiguation of "Lathauwer, Lieven De"

Author of the publication

copydeleteadd this publication to your clipboard
Blind identification of complex convolutive MIMO systems with 3 sources and 2 sensors.

, , and . ICASSP, page 1669-1672. IEEE, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Lieven

Lieven Pool

Alexander Lieven

Jens Lieven

Otto Lieven

 

Other publications of authors with the same name

Exponential data fitting using multilinear algebra: the single-channel and multi-channel case., , and . Numerical Lin. Alg. with Applic., 12 (8): 809-826 (2005)Multidimensional ESPRIT: A coupled canonical polyadic decomposition approach., and . SAM, page 441-444. IEEE, (2014)Shift invariance, incomplete arrays and coupled CPD: A case study., and . SAM, page 1-5. IEEE, (2016)Coupled tensor decompositions for applications in array signal processing., and . CAMSAP, page 228-231. IEEE, (2013)Unconstrained Optimization of Real Functions in Complex Variables., , and . SIAM J. Optim., 22 (3): 879-898 (2012)Spatially constrained ICA algorithm with an application in EEG processing., , and . Signal Process., 91 (8): 1963-1972 (2011)Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials., and . Comput. Meth. in Appl. Math., 19 (1): 147-163 (2019)Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-(Lr, n, Lr, n, 1) Terms - Part I: Uniqueness., and . SIAM J. Matrix Anal. Appl., 36 (2): 496-522 (2015)Decompositions of a Higher-Order Tensor in Block Terms - Part III: Alternating Least Squares Algorithms., and . SIAM J. Matrix Anal. Appl., 30 (3): 1067-1083 (2008)Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion., and . SIAM J. Matrix Anal. Appl., 40 (3): 888-917 (2019)