相关论文: A Near-Linear Kernel for Two-Parsimony Distance

In this paper we propose two behavioral distances that support approximate reasoning on Stochastic Markov Models (SMMs), that are continuous-time stochastic transition systems where the residence time on each state is described by a generic…

Phylogenetic trees play a key role in the reconstruction of evolutionary relationships. Typically, they are derived from aligned sequence data (like DNA, RNA, or proteins) by using optimization criteria like, e.g., maximum parsimony (MP).…

In this paper, we remark that any optimal coupling for the quadratic Wasserstein distance $W^2_2(\mu,\nu)$ between two probability measures $\mu$ and $\nu$ with finite second order moments on $\mathbb{R}^d$ is the composition of a…

In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of…

We show that if a reproducing kernel Hilbert space $H_K,$ consisting of functions defined on ${\bf E},$ enjoys Double Boundary Vanishing Condition (DBVC) and Linear Independent Condition (LIC), then for any preset natural number $n,$ and…

For a constant coefficient partial differential operator $P(D)$ with a single characteristic direction such as the time-dependent free Schr\"odinger operator as well as non-degenerate parabolic differential operators like the heat operator…

Laplacian spectral kernels and distances (e.g., biharmonic, heat diffusion, wave kernel distances) are easily defined through a filtering of the Laplacian eigenpairs. They play a central role in several applications, such as dimensionality…

Computing low-rank approximations of kernel matrices is an important problem with many applications in scientific computing and data science. We propose methods to efficiently approximate and store low-rank approximations to kernel matrices…

The problem of finding \emph{distance} between \emph{pattern} of length $m$ and \emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a…

In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the…

To numerically approximate Borel probability measures by finite atomic measures, we study the spectral decomposition of discrepancy kernels when restricted to compact subsets of $\mathbb{R}^d$. For restrictions to the Euclidean ball in odd…

We revisit the linear programming bounds for the size vs. distance trade-off for binary codes, focusing on the bounds for the almost-balanced case, when all pairwise distances are between $d$ and $n-d$, where $d$ is the code distance and…

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

The contributions of the paper span theoretical and implementational results. First, we prove that Kd-trees can be extended to spaces in which the distance is measured with an arbitrary Bregman divergence. Perhaps surprisingly, this shows…

We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree $T$ on $n$ leaves with a path metric $d$, consider the pairwise distances $\{d(u,v)\}$ between leaves. It is well known that these…

Distance-based tests, also called "energy statistics", are leading methods for two-sample and independence tests from the statistics community. Kernel-based tests, developed from "kernel mean embeddings", are leading methods for two-sample…

We consider parabolic operators of the form $$\partial_t+\mathcal{L},\ \mathcal{L}:=-\mbox{div}\, A(X,t)\nabla,$$ in $\mathbb R_+^{n+2}:=\{(X,t)=(x,x_{n+1},t)\in \mathbb R^{n}\times \mathbb R\times \mathbb R:\ x_{n+1}>0\}$, $n\geq 1$. We…

Determinantal Point Process (DPPs) are statistical models for repulsive point patterns. Both sampling and inference are tractable for DPPs, a rare feature among models with negative dependence that explains their popularity in machine…

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 investigate $(k_1,k_2)$-extendibility of fermionic Gaussian states, a property central to quantum correlations and approximations of separability. We show that these states are $(k_1,k_2)$-extendible if and only if they admit a fermionic…