Related papers: Fast Arithmetics Using Chinese Remaindering
In [1], we give Dickson's conjecture on $N^n$. In this paper, we further give Dickson's conjecture on $Z^n$ and obtain an equivalent form of Green-Tao's conjecture [2]. Based on our work, it is possible to establish a general theory that…
Learning rich and compact representations is an open topic in many fields such as object recognition or image retrieval. Deep neural networks have made a major breakthrough during the last few years for these tasks but their representations…
In this paper we describe in detail and generalize a method for quantum process tomography that was presented in [A. Bendersky, F. Pastawski, J. P. Paz, Physical Review Letters 100, 190403 (2008)]. The method enables the efficient…
This note presents fast Cholesky/LU/QR decomposition algorithms with $O(n^{2.529})$ time complexity when using the fastest known matrix multiplication. The algorithms have potential application, since a quickly made implementation using…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
We examine the polynomial form of the scattering equations by means of computational algebraic geometry. The scattering equations are the backbone of the Cachazo-He-Yuan (CHY) representation of the S-matrix. We explain how the Bezoutian…
We propose a communication and computation efficient second-order method for distributed optimization. For each iteration, our method only requires $\mathcal{O}(d)$ communication complexity, where $d$ is the problem dimension. We also…
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…
In this paper, we consider Caputo type fractional stochastic time-delay system with permutable matrices. We derive stochastic analogue of variation of constants formula via a newly defined delayed Mittag-Leffer type matrix function. Thus,…
Wu, Lou, Lai and Chang proposed a multi-exponentiation algorithm using binary complements and the non-adjacent form. The purpose of this paper is to show that neither the analysis of the algorithm given by its original proposers nor that by…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
A new series representation of the Madelung constant is given. We represent Madelung constant as a sum of an exact term plus an exponentially fast converging series. The remarkable result is that even if the series part is discarded, one…
Zonotopes are becoming an increasingly popular set representation for formal verification techniques. This is mainly due to their efficient representation and their favorable computational complexity of important operations in…
We study the effects of finite-precision representation of source's probabilities on the efficiency of classic source coding algorithms, such as Shannon, Gilbert-Moore, or arithmetic codes. In particular, we establish the following simple…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…
Robust estimation is essential in computer vision, robotics, and navigation, aiming to minimize the impact of outlier measurements for improved accuracy. We present a fast algorithm for Geman-McClure robust estimation, FracGM, leveraging…
We propose a new way for speeding up the search of the maximal solution $X_+$ of $X + A^\top X^{-1} A = Q$. It is known that the speed of convergence of traditional approaches for solving this problem depends highly on the spectral radius…
This paper develops practical summation techniques in ZXW calculus to reason about quantum dynamics, such as unitary time evolution. First we give a direct representation of a wide class of sums of linear operators, including arbitrary…
Rapidly developed neural models have achieved competitive performance in Chinese word segmentation (CWS) as their traditional counterparts. However, most of methods encounter the computational inefficiency especially for long sentences…