We present a unified framework to study graph kernels, special cases of which include the
random walk (Gärtner et al., 2003; Borgwardt et al., 2005) and marginalized (Kashima et al …

The Kronecker product has a rich and very pleasing algebra that supports a wide range of
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …

Explicit time integration schemes coupled with Galerkin discretizations of time-dependent
partial differential equations require solving a linear system with the mass matrix at each …

The purpose of this paper is manifold. In a first part, we present a new alternating least
squares (ALS)-based method for estimating the matrix factors of a Kronecker product, the so …

Image restoration applications often result in ill-posed least squares problems involving
large, structured matrices. One approach used extensively is to restore the image in the …

Traditionally, extending the Singular Value Decomposition (SVD) to third-order tensors
(multiway arrays) has involved a representation using the outer product of vectors. These …

Quantum entanglement is the core resource in quantum information processing and
quantum computing. It is a significant challenge to effectively characterize the entanglement …

Intelligent reflecting surface (IRS) is a promising technology for beyond of the wireless
communications. In fully passive IRS-assisted systems, channel estimation is challenging …

This paper considers the problem of finding n× n matrices Ak and Bk that minimize ||T-
∑A_k⊗B_k||_F, where ⊗ denotes Kronecker product and T is a banded n× n block Toeplitz …

We present a unified framework to study graph kernels, special cases of which include the
random walk graph kernel\citep {GaeFlaWro03, BorOngSchVisetal05}, marginalized graph …