The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the BurrowsWheeler transform and the suffix array, widely used in several fields of Computer Science. For this reason, several recent researches have been devoted to finding new strategies to obtain effective methods for such a sorting. In this paper we i...

Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

In this paper we study complete linear series on a hyperelliptic curve C of arithmetic genus g. Let A be the unique line bundle on C such that |A| is a g 2 , and let L be a line bundle on C of degree d. Then L can be factorized as L = A ⊗ B where m is the largest integer satisfying H(C,L⊗A) 6= 0. Let b = deg(B). We say that the factorization type of L is (m, b). Our main results in this paper a...

We used QCD factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios BR ( ?J/?K) and BR ( ?J/??), can be accounted for this approach. We analyzed the decay within the framework of QCD factorization. We have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. We calculated this decays in a special scale ...

For two types of moderate growth representations $(\mathbb{R}^d,+)$ on sequentially complete locally convex Hausdorff spaces (including F-representations [J. Funct. Anal. 262 (2012), 667-681], we introduce Denjoy-Carleman classes ultradifferentiable vectors and show a strong factorization theorem Dixmier-Malliavin type for them. In particular, our solves [Conjecture 6.; J. 667-681] analytic $G ...

the triple factorization of a group $g$ has been studied recently showing that $g=aba$ for some proper subgroups $a$ and $b$ of $g$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. in this paper we study two infinite classes of non-abelian finite groups $d_{2n}$ and $psl(2,2^{n})$...

This paper deals with multiwavelets and the different properties of approximation and smoothness associated with them. In particular, we focus on the important issue of the preservation of discrete-time polynomial signals by multifilterbanks. We introduce and detail the property of balancing for higher degree discrete-time polynomial signals and link it to a very natural factorization of the re...

Abstract. If a tensor with various symmetries is properly unfolded, then the resulting matrix inherits those symmetries. As tensor computations become increasingly important it is imperative that we develop efficient structure preserving methods for matrices with multiple symmetries. In this paper we consider how to exploit and preserve structure in the pivoted Cholesky factorization when appro...

In recent years, interest in recommender research has shifted from explicit feedback towards implicit feedback data. A diversity of complex models has been proposed for a wide variety of applications. Despite this, learning from implicit feedback is still computationally challenging. So far, most work relies on stochastic gradient descent (SGD) solvers which are easy to derive, but in practice ...

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...