English
Related papers

Related papers: A novel approach to the discovery of binary BBP-ty…

200 papers

Many real-world scientific processes are governed by complex nonlinear dynamic systems that can be represented by differential equations. Recently, there has been increased interest in learning, or discovering, the forms of the equations…

Methodology · Statistics 2022-10-20 Joshua S. North , Christopher K. Wikle , Erin M. Schliep

We present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structured. That enables us to perform hashing more efficiently and…

Data Structures and Algorithms · Computer Science 2015-05-14 Krzysztof Choromanski

In the last two decades about a dozen methods were invented which derive, from a series of composite spectra over the orbit, the spectra of individual components in binary and multiple systems. Reconstructed spectra can then be analyzed…

Solar and Stellar Astrophysics · Physics 2009-09-18 K. Pavlovski , H. Hensberge

We prove sum formulas for double polylogarithms of Hurwitz type, that is, involving a shifting parameter $b$ in the denominator. These formulas especially imply well-known sum formulas for double zeta values, and sum formulas for double…

Number Theory · Mathematics 2014-09-02 Kohji Matsumoto , Hirofumi Tsumura

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

Number Theory · Mathematics 2015-12-22 Markus Hittmeir

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

Numerical Analysis · Mathematics 2020-09-15 Hashim A. Yamani , Abdulaziz D. Alhaidari

Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…

Information Theory · Computer Science 2024-02-20 Mohamadou Sall , M. Anwar Hasan

In problem solving, understanding the problem that one seeks to solve is an essential initial step. In this paper, we propose computational methods for facilitating problem understanding through the task of recognizing the unknown in…

Computation and Language · Computer Science 2021-11-30 Ndapa Nakashole

We propose a new type of soliton equation, which is obtained from the generalized discrete BKP equation. The obtained equation admits two types of soliton solutions. The signs of amplitude and velocity of the soliton solution are opposite…

Exactly Solvable and Integrable Systems · Physics 2019-12-09 Hidetomo Nagai , Nobuhiko Shinzawa

A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…

Probability · Mathematics 2016-12-20 Bernard Ycart , Rémy Drouilhet

Integer division instruction is generally expensive in most architectures. If the divisor is constant, the division can be transformed into combinations of several inexpensive integer instructions. This article discusses the classic…

Data Structures and Algorithms · Computer Science 2024-12-06 Yifei Li

We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.

Algebraic Geometry · Mathematics 2022-10-13 Gabriel E. Monsalve

Astronomical polarimetry is a powerful technique that can provide physical information sometimes difficult or impossible to obtain by any other type of observation. Almost every class of binary star can benefit from polarimetric…

Astrophysics · Physics 2007-05-23 N. Manset

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Symbolic Computation · Computer Science 2015-07-14 Yong-Jin Kim , Hyon-Song Paek , Nam-Chol Kim , Chong-Il Byon

Considering multivariate strongly mixing time series, nonparametric tests for a constant copula with specified or unspecified change point (candidate) are derived; the tests are consistent against general alternatives. A tapered block…

Statistics Theory · Mathematics 2012-06-11 Axel Bücher , Martin Ruppert

We continue the study of constructing explicit extractors for independent general weak random sources. The ultimate goal is to give a construction that matches what is given by the probabilistic method --- an extractor for two independent…

Computational Complexity · Computer Science 2015-03-10 Xin Li

One of the main purposes of this article is to give functional equations and differential equations between Bernstein basis functions and generating functions of B-spline curves. Using these equations, very useful formulas containing the…

Classical Analysis and ODEs · Mathematics 2024-01-09 Yilmaz Simsek

This paper proposes a generic formulation that significantly expedites the training and deployment of image classification models, particularly under the scenarios of many image categories and high feature dimensions. As a defining…

Computer Vision and Pattern Recognition · Computer Science 2016-03-15 Fumin Shen , Yadong Mu , Wei Liu , Yang Yang , Heng Tao Shen

A novel mixed spectral-Galerkin method based on generalized ball polynomials is proposed for solving the biharmonic equation on a unit ball. By introducing an auxiliary variable to decouple the biharmonic equation into a system of…

Numerical Analysis · Mathematics 2026-05-29 Mengxue Gao , Bing Su , Jianwei Zhou

In this paper, we define binary block codes over subsets of real algebras obtained by the Cayley-Dickson process and we provide an algorithm to obtain codes with a better rate. This algorithm offers more flexibility than other methods known…

Information Theory · Computer Science 2015-06-01 Cristina Flaut