Results 21 to 30 of about 5,810,036 (263)

Another estimation of Laplacian spectrum of the Kronecker product of graphs [PDF]

open access: yesInformation Sciences, 2021
The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of graphs using ...
Milan Basic, Branko Arsić, Z. Obradovic
semanticscholar   +1 more source

Efficient Compact Bilinear Pooling via Kronecker Product

open access: yesAAAI Conference on Artificial Intelligence, 2022
Bilinear pooling has achieved excellent performance in fine-grained recognition tasks. Nevertheless, high-dimensional bilinear features suffer from over-fitting and inefficiency.
Tan Yu, Yunfeng Cai, Ping Li
semanticscholar   +1 more source

On the crossing number for Kronecker product of a tripartite graph with path

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the one ...
N. Shanthini, J. Baskar Babujee
doaj   +1 more source

The complexity of computing Kronecker coefficients [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group $S_n$. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur ...
Peter Bürgisser, Christian Ikenmeyer
doaj   +1 more source

‎Distinguishing index of Kronecker product of two graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2021
The distinguishing index D'(G)  of a graph G is the least integer d such that G has an edge labeling with d labels that is preserved only by a trivial automorphism. The Kronecker product G x H of two graphs G and H is the graph with vertex set V(G) x V(H)
‎Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

On the Ψ-asymptotic equivalence of the Ψ-bounded solutions of two Lyapunov matrix differential equations [PDF]

open access: yesITM Web of Conferences, 2020
Using Schauder Tychonoff fixed point theorem and the technique of Kronecker product of matrices, we prove existence results for Ψ-asymptotic equivalence of the Ψ-bounded solutions of two Lyapunov matrix differential equations.
Diamandescu Aurel
doaj   +1 more source

Testing Kronecker Product Covariance Matrices for High-Dimensional Matrix-Variate Data

open access: yesBiometrika, 2022
The Kronecker product covariance structure provides an efficient way to model the inter-correlations of matrix-variate data. In this paper, we propose test statistics for the Kronecker product covariance matrix based on linear spectral statistics of ...
Long Yu, Jiahui Xie, Wang Zhou
semanticscholar   +1 more source

Beamforming with Cube Microphone Arrays Via Kronecker Product Decompositions

open access: yesIEEE/ACM Transactions on Audio Speech and Language Processing, 2021
Microphone arrays combined with beamforming have been widely used to solve many important acoustic problems in a wide range of applications. Much effort has been devoted in the literature to microphone array beamforming, among which the Kronecker product
Xuehan Wang   +4 more
semanticscholar   +1 more source

The strong Kronecker product

open access: yesJournal of Combinatorial Theory, Series A, 1994
The paper obtains algebraic structure theorems and properties for the strong Kronecker product of two block matrices, \(M= [M_{ij}]\) and \(N= [N_{jk}]\), where \(i= 1,\dots,r\), \(j= 1,\dots,t\), \(k= 1,\dots,u\), each \(M_{ij}\) is an \(m\times p\) submatrix, each \(N_{jk}\) is an \(n\times q\) matrix, namely: \(M\circ N= [L_{ik}]\), \(i= 1,\dots,r\),
de Launey, Warwick, Seberry, Jennifer
openaire   +2 more sources

On the Design of Differential Kronecker Product Beamformers

open access: yesIEEE/ACM Transactions on Audio Speech and Language Processing, 2021
In this paper, we present a generalized approach for differential microphone array (DMA) beamforming in the short-time Fourier transform (STFT) domain. We propose a multistage beamforming approach, which considers a Kronecker product (KP) decomposition ...
G. Itzhak, J. Benesty, I. Cohen
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy