Related papers: Prefactor Reduction of the Guruswami-Sudan Interpo…
Low-rank matrix decomposition has gained great popularity recently in scaling up kernel methods to large amounts of data. However, some limitations could prevent them from working effectively in certain domains. For example, many existing…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…
We propose a method to interpolate Signed Distance Function (SDF) data from a discrete set of samples. Unlike prior work, our approach ensures that the new SDF data values are fully consistent with the input and each other, such that the…
The derivation of combined prefactored compact schemes for first and second order derivatives is described here, relying on the Fourier analysis of the original prefactored compact schemes. By this approach, the order of accuracy of the…
For many compiled languages, source-level types are erased very early in the compilation process. As a result, further compiler passes may convert type-safe source into type-unsafe machine code. Type-unsafe idioms in the original source and…
The performance of existing single-view 3D reconstruction methods heavily relies on large-scale 3D annotations. However, such annotations are tedious and expensive to collect. Semi-supervised learning serves as an alternative way to…
In this paper we present a modification of Reed-Solomon codes that beats the Guruwami-Sudan $1-\sqrt{R}$ decoding radius of Reed-Solomon codes at low rates $R$. The idea is to choose Reed-Solomon codes $U$ and $V$ with appropriate rates in…
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on low-complexity…
In the field of image fusion, promising progress has been made by modeling data from different modalities as linear subspaces. However, in practice, the source images are often located in a non-Euclidean space, where the Euclidean methods…
Abstraction is a successful technique in software verification, and interpolation on infeasible error paths is a successful approach to automatically detect the right level of abstraction in counterexample-guided abstraction refinement.…
In this paper, we introduce and study the class of generalized square-difference factor absorbing (gsdf-absorbing) submodules of modules over commutative rings. We provide various characterizations and properties of gsdf-absorbing…
A Cross-Product Free (CPF) Jacobi-Davidson (JD) type method is proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair $(A,B)$. It implicitly solves the mathematically equivalent…
We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm computes a list of message words that correspond to all closest…
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine…
In this paper, we give a way to construct graded filtrations of graded modules. We then apply it to the Sally module, which describes a correction term of the Hilbert function. As a result, we obtain the inequality of the Hilbert…
We propose a method for the construction of preconditioners of parameter-dependent matrices for the solution of large systems of parameter-dependent equations. The proposed method is an interpolation of the matrix inverse based on a…