Related papers: Distance-Increasing Maps of All Length by Simple M…
Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a generalized greedy heuristic for finding feasible solutions, and…
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate…
Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…
We introduce a practical approach to extract the symplectic transfer maps for arbitrary magnetic beam-line elements. Beam motion in particle accelerators depends on linear and nonlinear magnetic fields of the beam-line elements. These…
There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices, must be taken into account. It is known that for continuous…
Distance metric learning is a branch of machine learning that aims to learn distances from the data, which enhances the performance of similarity-based algorithms. This tutorial provides a theoretical background and foundations on this…
We show how a set of POVMs, expressed as a set of $\mu$ linear maps, can be performed with a unitary transformation followed by a von-Neumann measurement with an ancillary system of no more than $\mu N^2$ dimensions. This result shows that…
For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to…
Graph comparison plays a major role in many network applications. We often need a similarity metric for comparing networks according to their structural properties. Various network features - such as degree distribution and clustering…
Circuit augmentation schemes are a family of combinatorial algorithms for linear programming that generalize the simplex method. To solve the linear program, they construct a so-called monotone circuit walk: They start at an initial vertex…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homology maps a potentially…
In this paper we extend the definitions of mean dimension and metric mean di-mension for non-autonomous dynamical systems. We show some properties of this extension and furthermore some applications to the mean dimension and metric mean…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
Hypergeometric functions provide a useful representation of Feynman diagrams occuring in precision phenomenology. In dimension regularization, the epsilon-expansion of these functions about d=4 is required. We discuss the current status of…
Applications in machine learning and data mining require computing pairwise Lp distances in a data matrix A. For massive high-dimensional data, computing all pairwise distances of A can be infeasible. In fact, even storing A or all pairwise…
An alternate direction method of multipliers (ADMM)-based detectors can achieve good performance in both small and large-scale multiple-input multiple-output (MIMO) systems. However, due to the difficulty of choosing the optimal penalty…