Related papers: On the Petras algorithm for verified integration o…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
A method is presented for the evaluation of integrals on tetrahedra where the integrand has an integrable singularity at one vertex. The approach uses a transformation to spherical polar coordinates which explicitly eliminates the…
The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. The goal is to look at the algorithmic data processing from the…
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes…
An algorithm to obtain equations between theta functions with integral characteristics evaluated at $\tau$ and $p\tau$ for $g>1$ is presented.
For estimating a lower bounded parametric function in the framework of Marchand and Strawderman (2006), we provide through a unified approach a class of Bayesian confidence intervals with credibility $1-\alpha$ and frequentist coverage…
Smale's alpha-theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to a square polynomial system. The program alphaCertified implements…
This work is an extension of previous work by Alazah et al. [M. Alazah, S. N. Chandler-Wilde, and S. La Porte, Numerische Mathematik, 128(4):635-661, 2014]. We split the computation of the Fresnel Integrals into 3 cases: a truncated Taylor…
We study the statistical complexity of estimating partition functions given sample access to a proposal distribution and an unnormalized density ratio for a target distribution. While partition function estimation is a classical problem,…
We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…
We can find in the literature several convergent and/or asymptotic expansions of the Pearcey integral $P(x,y)$ in different regions of the complex variables $x$ and $y$, but they do not cover the whole complex $x$ and $y$ planes. The…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
In this paper are examined general classes of linear and non-linear analytical systems of partial differential equations. Indeed the integrability conditions are found and if they are satisfied, the solutions are given as functional series…
We give a technical overview of our exact-real implementation of various representations of the space of continuous unary real functions over the unit domain and a family of associated (partial) operations, including integration, range…
We introduce a new complexity measure for finite strings using probabilistic finite-state automata (PFAs), in the same spirit as existing notions employing DFAs and NFAs, and explore its properties. The PFA complexity $A_P(x)$ is the least…
We study integration in a class of Hilbert spaces of analytic functions defined on the $\mathbb{R}^s$. The functions are characterized by the property that their Hermite coefficients decay exponentially fast. We use Gauss-Hermite…
We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…
We introduce a new method to evaluate algebraic integrals over the simplex numerically. This new approach employs techniques from tropical geometry and exceeds the capabilities of existing numerical methods by an order of magnitude. The…
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…
We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we give W[1]-hardness results for many problems about 1-safe…