<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Fast adaptive PARAFAC decomposition algorithm with linear complexity"^^ . "We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments."^^ . "2016-03-20" . . . . . . . . . . . . . . "Viet Dung"^^ . "Nguyen"^^ . "Viet Dung Nguyen"^^ . . "Linh Trung"^^ . "Nguyen"^^ . "Linh Trung Nguyen"^^ . . "Karim"^^ . "Abed-Meraim"^^ . "Karim Abed-Meraim"^^ . . . . "2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"^^ . . . . . "China"^^ . . . . . . "Fast adaptive PARAFAC decomposition algorithm with linear complexity (PDF)"^^ . . . "IEEE Xplore Abstract - Fast adaptive PARAFAC decomposition algorithm with linear complexity.pdf"^^ . . "HTML Summary of #1766 \n\nFast adaptive PARAFAC decomposition algorithm with linear complexity\n\n" . "text/html" . . . "Electronics and Communications"@en . . . "Electronics and Computer Engineering"@en . .