Related papers: Efficient formulas for efficiency correction of cu…

This paper presents new methodology for computationally efficient kernel density estimation. It is shown that a large class of kernels allows for exact evaluation of the density estimates using simple recursions. The same methodology can be…

Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row…

In the linear random effects model, when distributional assumptions such as normality of the error variables cannot be justified, moments may serve as alternatives to describe relevant distributions in neighborhoods of their means.…

In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common that not all the efficient solutions can be computed in a short time and the…

This study investigates the use of fractional order differential models to simulate the dynamic response of non-homogeneous discrete systems and to achieve efficient and accurate model order reduction. The traditional integer order approach…

Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…

In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several…

In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…

Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations focus on two-level qubits, the underlying physics used in most…

We show how conformal invariance predicts the functional form of two-point correlators in one-dimensional periodic quantum systems. Numerical evidence for this functional form in a wide class of models --- including long-ranged ones --- is…

We present a systematic procedure for analyzing cumulants to arbitrary order in the context of heavy-ion collisions. It generalizes and improves existing procedures in many respects. In particular, particles which are correlated are allowed…

In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…

In our work, we consider the classical density-based approach to the topology optimization. We propose to modify the discretized cost functional using a posteriori error estimator for the finite element method. It can be regarded as a new…

Precision tuning or customized precision number representations is emerging, in these recent years, as one of the most promising techniques that has a positive impact on the footprint of programs concerning energy consumption, bandwidth…

A Reduction -- an accumulation over a set of values, using an associative and commutative operator -- is a common computation in many numerical computations, including scientific computations, machine learning, computer vision, and…

We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…

We generalize effective energy variational techniques to study appropriately quantized solitonic field configurations. Our approach rests on collective quantization ideas and is specifically designed for the numerical evaluation of soliton…

Data from different sources rarely conform to a single formatting even if they describe the same set of entities, and this raises concerns when data from multiple sources must be joined or cross-referenced. Such a formatting mismatch is…

An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…