Related papers: Efficient Calculation of Crossing Symmetric BCJ Tr…

Determining the interaction partners among protein/domain families poses hard computational problems, in particular in the presence of paralogous proteins. Available approaches aim to identify interaction partners among protein/domain…

Tree kernels are fundamental tools that have been leveraged in many applications, particularly those based on machine learning for Natural Language Processing tasks. In this paper, we devise a parallel implementation of the sequential…

For the general renormalizable N=1 supersymmetric Yang--Mills theory, regularized by higher covariant derivatives, a two-loop beta-function is calculated. It is shown that all integrals, needed for obtaining this function, can be easily…

The Pauli matrices are 2-by-2 matrices that are very useful in quantum computing. They can be used as elementary gates in quantum circuits but also to decompose any matrix of $\mathbb{C}^{2^n \times 2^n}$ as a linear combination of tensor…

We start with some methodic remarks referring to purely bosonic quantum systems and then explain how corrections to the leading--order quasiclassical result for the fermion--graded partition function Tr{(-1)^F exp(-\beta H)} can be…

We study an implementation of the theoretical splitting scheme introduced in [Chassagneux and Yang, 2022] for singular FBSDEs [Carmona and Delarue 2013] and their associated quasi-linear degenerate PDEs. The fully implementable algorithm is…

This paper introduces the Partition Tree Weighting technique, an efficient meta-algorithm for piecewise stationary sources. The technique works by performing Bayesian model averaging over a large class of possible partitions of the data…

We demonstrate that the tree level amplitudes and the explicit formulas of soft factors can be uniquely determined by soft theorems and the universality of soft factors. By imposing the soft theorems and the universality, as well as the…

We compute the two and three loop corrections to the beta function for Yang-Mills theories in the background gauge field method and using the background gauge field as the only source. The calculations are based on the separation of the one…

Bayesian regression trees are flexible non-parametric models that are well suited to many modern statistical regression problems. Many such tree models have been proposed, from the simple single- tree model to more complex tree ensembles.…

This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents a large IO file. A task can only be executed if all input and output files fit into memory, and a file can only…

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…

SU(N) Yang-Mills integrals form a new class of matrix models which, in their maximally supersymmetric version, are relevant to recent non-perturbative definitions of 10-dimensional IIB superstring theory and 11-dimensional M-theory. We…

In our recent works, a new approach for constructing tree amplitudes, based on exploiting soft behaviors, was proposed. In this paper, we extend this approach to effective theories for gluons which incorporate higher-derivative…

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…

It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees,…

We consider efficient route planning for robots in applications such as infrastructure inspection and automated surgical imaging. These tasks can be modeled via the combinatorial problem Graph Inspection. The best known algorithms for this…

We construct a tree-based dependence structure for the representation of binomial, Poisson and Gaussian random vectors having a given covariance matrix, using sums of independent random variables. This construction allows us to characterize…

We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a $(1+\epsilon)$…

We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of different type appear sequentially. Each node of the pair…