Related papers: Iterations of the generalized Gram-Schmidt procedu…
A general master action in terms of superfields is given which generates generalized Poisson sigma models by means of a natural ghost number prescription. The simplest representation is the sigma model considered by Cattaneo and Felder. For…
Using Symbolic Dynamic Programming we describe algorithms, fully implemented in Maple, for automatically generating generating functions introduced by Richard Stanley in his study of generalized Stern arrays, generalized even further, to…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
Distributed Gaussian process (DGP) is a popular approach to scale GP to big data which divides the training data into some subsets, performs local inference for each partition, and aggregates the results to acquire global prediction. To…
Gaussian processes are typically used for smoothing and interpolation on small datasets. We introduce a new Bayesian nonparametric framework -- GPatt -- enabling automatic pattern extrapolation with Gaussian processes on large…
We present the evaluation of a closed form formula for the calculation of the original step between two randomly shifted fringe patterns. Our proposal extends the Gram--Schmidt orthonormalization algorithm for fringe pattern.…
The generalized mean-square fractional integrals $\mathcal{J}_{\rho,\lambda,u+;\omega}^{\sigma}$ and $\mathcal{J}_{\rho,\lambda,v-;\omega}^{\sigma}$ of the stochastic process $X$ are introduced. Then, for Jensen-convex and strongly convex…
Since the seminal work by Nagel and Weiss, the iteration stable (STIT) tessellations have attracted considerable interest in stochastic geometry as a natural and flexible, yet analytically tractable model for hierarchical spatial…
Continuous generalized fusion frame theory was recently introduced by Rahimi and al. Several equalities and inequalities have been obtained for frame, fusion generalized fusion frame, among others. In the present paper, we continue and…
Generalised planning (GP) refers to the task of synthesising programs that solve families of related planning problems. We introduce a novel, yet simple method for GP: given a set of training problems, for each problem, compute an optimal…
Randomized iterative methods, such as the Kaczmarz method and its variants, have gained growing attention due to their simplicity and efficiency in solving large-scale linear systems. Meanwhile, absolute value equations (AVE) have attracted…
Witten's Gauged Linear $\sigma$-Model (GLSM) unifies the Gromov-Witten theory and the Landau-Ginzburg theory, and provides a global perspective on mirror symmetry. In this article, we summarize a mathematically rigorous construction of the…
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric…
The orthogonalization process is an essential building block in Krylov space methods, which takes up a large portion of the computational time. Commonly used methods, like the Gram-Schmidt method, consider the projection and normalization…
We introduce and study a multiparameter version of the generalized counting process (GCP), where there is a possibility of finitely many arrivals simultaneously. We call it the multiparameter GCP. In a particular case, it is uniquely…
A frame is a system of vectors $S$ in Hilbert space $\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\mathscr{H}$; expressed in…
The computation of 2-D optical flow by means of regularized pel-recursive algorithms raises a host of issues, which include the treatment of outliers, motion discontinuities and occlusion among other problems. We propose a new approach…
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…
This paper introduces the Non-homogeneous Generalized Skellam process (NGSP) and its fractional version NGFSP by time changing it with an independent inverse stable subordinator. We study distributional properties for NGSP and NGFSP…
Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal…