Results 21 to 30 of about 42,044 (303)
The Tensor Product of Polynomials [PDF]
Experimental Mathematics, 1999 Using Grobner basis algorithms in MAGMA we find necessary and sufficient conditions for a polynomial of degree 6 over any field to bethe tensor product of two polynomials, one of degree 3 and one of degree 2.
openaire +2 more sources
Varying Coefficient Tensor Models for Brain Imaging [PDF]
, 2005 We revisit a multidimensional varying-coefficient model (VCM), by allowing regressor coefficients to vary smoothly in more than one dimension, thereby extending the VCM of Hastie and Tibshirani.
Marx, Brian D. +2 more
core +1 more source
Spline- and tensor-based signal reconstruction : from structure analysis to high-performance algorithms to multiplatform implementations and medical applications [PDF]
, 2015 The problem of signal reconstruction is of fundamental practical value for many applications associated with the field of signal and image processing.
Morozov, Oleksii
core +1 more source
, 2021 We prove that the 2-Deligne tensor product of two compact semisimple 2-categories exists. Further, under suitable hypotheses, we explain how to describe the $Hom$-categories, connected components, and simple objects of a 2-Deligne tensor product. Finally,
Décoppet, Thibault D.
core +1 more source
Stabilizing tensor products [PDF]
Proceedings of the American Mathematical Society, 1975 Let C C be a symmetric monoidal category with a suspension, and let SC be the ...
openaire +2 more sources
Journal of Pure and Applied Algebra, 2009 Let \(A=A_1\oplus\cdots\oplus A_r\) be a decomposition of the associative algebra \(A\) as a direct sum of its vector subspaces \(A_i\). This decomposition is regular if for any choice of the indices \(i_j\) one has \(A_{i_1}\cdots A_{i_n}\neq 0\), and furthermore for every \(i\) and \(j\) and every \(x_i\in A_i\), \(x_j\in A_j\) one has \(x_ix_j ...
Bahturin, Yuri, Regev, Amitai
openaire +1 more source
IEEE Transactions on Quantum Engineering, 2020 We provide a procedure to construct entanglement-assisted Calderbank-Shor-Steane (CSS) codes over qudits from the parity check matrices of two classical codes over Fq, where q = pk, p is prime, and k is a positive integer.
Priya J. Nadkarni +1 more
doaj +1 more source
Tensor product of partial acts
, 2022 In this article we define the tensor product of partial acts over a semigroup and prove several properties of this tensor product. We also define the notion of a polite partial biact, which is needed to define partial actions on the tensor product of ...
Saarse, Heleen, Väljako, Kristo
core +1 more source
Edge detection using nonlinear structure tensor
Nonlinear Engineering, 2022 In order to improve the performance of edge detection for noisy images, a new edge detection method based on nonlinear structure tensor is proposed. First, the tensor product of noisy images is calculated.
Yuan Shuping +3 more
doaj +1 more source
Tensor-matrix products with a compressed sparse tensor [PDF]
Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, 2015 The Canonical Polyadic Decomposition (CPD) of tensors is a powerful tool for analyzing multi-way data and is used extensively to analyze very large and extremely sparse datasets. The bottleneck of computing the CPD is multiplying a sparse tensor by several dense matrices. Algorithms for tensor-matrix products fall into two classes.
Shaden Smith, George Karypis
openaire +1 more source