Results 231 to 240 of about 10,455 (264)
Some of the next articles are maybe not open access.
A Rank-One Tensor Updating Algorithm for Tensor Completion
IEEE Signal Processing Letters, 2015In this letter, we propose a rank-one tensor updating algorithm for solving tensor completion problems. Unlike the existing methods which penalize the tensor by using the sum of nuclear norms of unfolding matrices, our optimization model directly employs the tensor nuclear norm which is studied recently.
Yuning Yang +2 more
openaire +2 more sources
Automorphisms of Tensor Completions of Algebras
Algebra and Logic, 2005Summary: In the classical representation of different groups, frequent use is made of a linear automorphism group of various algebras. Since the linear automorphism group is only part of a full automorphism group, such an approach might seem to be too restrictive.
openaire +2 more sources
Journal of Algorithms, 1989
We prove that computing the rank of a three-dimensional tensor over any finite field is NP-complete. Over the rational numbers the problem is NP-hard.
openaire +2 more sources
We prove that computing the rank of a three-dimensional tensor over any finite field is NP-complete. Over the rational numbers the problem is NP-hard.
openaire +2 more sources
An Adaptive Correction Approach for Tensor Completion
SIAM Journal on Imaging Sciences, 2016Summary: In this paper, we study the tensor completion problem on recovery of the multilinear data under limited sampling. A popular convex relaxation of this problem is to minimize the nuclear norm of the more square matrix produced by matricizing a tensor. However, it may fail to produce a highly accurate solution under low sample ratio.
Minru Bai +3 more
openaire +1 more source
Weighted tensor nuclear norm minimization for tensor completion using tensor-SVD
Pattern Recognition Letters, 2020Abstract In this paper, we consider the tensor completion problem, which aims to estimate missing values from limited information. Our model is based on the recently proposed tensor-SVD, which uses the relationships among the color channels in an image or video recovery problem. To improve the availability of the model, we propose the weighted tensor
Yang Mu +4 more
openaire +1 more source
TENSOR COMPLETION FOR A CERTAIN CLASS OF GROUPS
International Journal of Algebra and Computation, 1996In this paper we construct the tensor A-completion over an arbitrary torsion-free ring A for groups whose maximal abelian subgroups are either conjugate separated or A-modules. As a corollary, this result gives us an explicit description of the structure of tensor completion for groups of the form F/N′, in particular, for free solvable groups. We also
openaire +2 more sources
ON TENSOR PRODUCTS OF MONOTONE COMPLETE ALGEBRAS
The Quarterly Journal of Mathematics, 1984Over thirty years ago, Kaplansky initiated the study of \(AW^*\)-algebras and, in particular, extended the Murray-von Neumann classification to those more general algebras. He gave a complete analysis of Type I \(AW^*\)-algebras and showed that an \({\mathcal N}\)-homogeneous Type I \(AW^*\)-algebra may be regarded as an \({\mathcal N}\times {\mathcal ...
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire +1 more source
Tensor Wheel Decomposition and Its Tensor Completion Application
Advances in Neural Information Processing Systems 35, 2022Zhong-Cheng Wu +4 more
openaire +2 more sources
Nonlocal Low-Rank Tensor Completion for Visual Data
IEEE Transactions on Cybernetics, 2021Bo Du, Lefei Zhang
exaly