Related papers: Replica Fourier Transforms on Ultrametric Trees, a…
Behavior Trees constitute a widespread AI tool which has been successfully spun out in robotics. Their advantages include simplicity, modularity, and reusability of code. However, Behavior Trees remain a high-level decision making engine;…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We give an introductory review of Fourier-Mukai transforms and their application to various aspects of moduli problems, string theory and mirror symmetry. We develop the necessary mathematical background for Fourier-Mukai transforms such as…
By suitably generalizing the Fourier constraint projection in the difference map phasing algorithm, an object can be reconstructed from its diffraction pattern even when the latter has been incoherently averaged over a discrete group of…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
Decision trees (DTs) and their random forest (RF) extensions are workhorses of classification and regression in Euclidean spaces. However, algorithms for learning in non-Euclidean spaces are still limited. We extend DT and RF algorithms to…
Three standard subtree transfer operations for binary trees, used in particular for phylogenetic trees, are: tree bisection and reconnection ($TBR$), subtree prune and regraft ($SPR$) and rooted subtree prune and regraft ($rSPR$). For a…
In this article we construct a maximal set of kernels for a multi-parameter linear scale-space that allow us to construct trees for classification and recognition of one-dimensional continuous signals similar the Gaussian linear scale-space…
We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g.…
The supertree construction problem is about combining several phylogenetic trees with possibly conflicting information into a single tree that has all the leaves of the source trees as its leaves and the relationships between the leaves are…
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…
Explicit representations of complex structures on closed manifolds are valuable, but relatively rare in the literature. Using isoparametric theory, we construct complex structures on isoparametric hypersurfaces with $g=4, m=1$ in the unit…
Unparticles are realized by deconstruction in higher extra dimensions. It is shown that in this framework when the scale invariance is broken, the corresponding spectral function of the unparticle is shifted by an amount of the breaking…
In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a…
The problem of reconstructing evolutionary trees or phylogenies is of great interest in computational biology. A popular model for this problem assumes that we are given the set of leaves (current species) of an unknown binary tree and the…
We construct new M-theory solutions starting from those that contain 5 U(1) isometries. We do this by reducing along one of the 5-torus directions, then T-dualizing via the action of an O(4,4) matrix and lifting back to 11-dimensions. The…
The family of circular Jacobi $\beta$ ensembles has a singularity of a type associated with Fisher and Hartwig in the theory of Toeplitz determinants. Our interest is in the Fourier transform of the corresponding bulk scaled spectral…
Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. However, it is well-known that the evolution of gene families…
Tree rearrangement operations typically induce a metric on the space of phylogenetic trees. One important property of these metrics is the size of the neighbourhood, that is, the number of trees exactly one operation from a given tree. We…
In many modern applications, including analysis of gene expression and text documents, the data are noisy, high-dimensional, and unordered--with no particular meaning to the given order of the variables. Yet, successful learning is often…