相关论文: A novel approach to the discovery of binary BBP-ty…

This paper presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

The emergent field of probabilistic numerics has thus far lacked clear statistical principals. This paper establishes Bayesian probabilistic numerical methods as those which can be cast as solutions to certain inverse problems within the…

Multidimensional population balance models (PBMs) describe chemical and biological processes having a distribution over two or more intrinsic properties (such as size and age, or two independent spatial variables). The incorporation of…

In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…

We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…

This paper introduces new technique for efficient calculation of different Shannon information measures which operates Binary Decision Diagrams (BDDs). We offer an algorithm of BDD reordering which demonstrates the improvement of the…

We consider private polynomial computation (PPC) over noncolluding coded databases. In such a setting a user wishes to compute a multivariate polynomial of degree at most $g$ over $f$ variables (or messages) stored in multiple databases…

A new algorithm for extraction of asymmetries from polarized lepton-nucleon scattering data is proposed. The algorithm is stable to set-up acceptance and/or luminosity monitor acceptance variations. A statistical test for checking the data…

This is an attempt of a comprehensive survey of the results in which estimates of the norms of linear means of multiple Fourier series, the Lebesgue constants, are obtained by means of estimating the Fourier transform of a function…

Coded computing is an effective technique to mitigate "stragglers" in large-scale and distributed matrix multiplication. In particular, univariate polynomial codes have been shown to be effective in straggler mitigation by making the…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

Binary, or one-bit, representations of data arise naturally in many applications, and are appealing in both hardware implementations and algorithm design. In this work, we study the problem of data classification from binary data and…

We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…

This study investigates computationally efficient inner-loop algorithms for estimating static/dynamic BLP models. It provides the following ideas for reducing the number of inner-loop iterations: (1). Add a term relating to the outside…

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…

Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…

Let $b \geq 3$ be a positive integer. A natural number is said to be a base-$b$ Zuckerman number if it is divisible by the product of its base-$b$ digits. Let $\mathcal{Z}_b(x)$ be the set of base-$b$ Zuckerman numbers that do not exceed…