Related papers: Flattening Karatsuba's recursion tree into a singl…

Formulas are presented for the recursive generation of four-body integrals in which the integrand consists of arbitrary integer powers (>= -1) of all the interparticle distances r_ij, multiplied by an exponential containing an arbitrary…

This work describes a new version of the Fast Multipole Method for summing pairwise particle interactions that arise from discretizing integral transforms and convolutions on the sphere. The kernel approximations use barycentric Lagrange…

In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an…

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…

We survey results on the foldability of flat origami models. The main topics are the question of when a given crease pattern can fold flat, the combinatorics of mountain and valley creases, and counting how many ways a given crease pattern…

By making use of the multiplicate form of the extended Carlitz inverse series relations, we establish two general `dual' theorems of Jackson's summation formula for well--poised $_8\phi_7$-series. Their duplicate forms under the partition…

We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work [17], where the single vector signal can be…

A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the…

We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be…

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the…

We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…

Tree-structured LSTM is promising way to consider long-distance interaction over hierarchies. However, there have been few research efforts on the hyperparameter tuning of the construction and traversal of tree-structured LSTM. To name a…

Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a…

We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.

We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be…

This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…

It is known that difference equations generated as the Newton-Raphson iteration for quadratic equations are solvable in closed form, and the solution can be constructed from linear three-term recurrence relations with constant coefficients.…