相关论文: An optimal matching problem

In this paper we describe a new method of obtaining ideal solutions of the well-known Tarry-Escott problem, that is, the problem of finding two distinct sets of integers $x_i,\;i=1,\,2,\,\dots,\,k+1$ and $y_i,\;i=1,\,2,\,\dots,\,k+1$ such…

We establish a characterization of the extraordinary dimension of perfect maps between metrizable spaces.

In the Triangle-Free (Simple) 2-Matching problem we are given an undirected graph $G=(V,E)$. Our goal is to compute a maximum-cardinality $M\subseteq E$ satisfying the following properties: (1) at most two edges of $M$ are incident on each…

In this work we consider the {\em image matching} problem for two grayscale $n \times n$ images, $M_1$ and $M_2$ (where pixel values range from 0 to 1). Our goal is to find an affine transformation $T$ that maps pixels from $M_1$ to pixels…

We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to compare elements of mixed dimension, we…

The graph matching optimization problem is an essential component for many tasks in computer vision, such as bringing two deformable objects in correspondence. Naturally, a wide range of applicable algorithms have been proposed in the last…

The main aim of the paper is to give a full classification (up to isometry) of all metric spaces X with the following two properties: X contains a compact set with non-empty interior; and for any three distinct points a, b and c of X there…

For given positive integers $m$ and $n$ with $m<n$, the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$th moments for $1\leq k\leq m$; in the ideal case one requires…

In mathematical modelling, the data and solutions are represented as measurable functions and their quality is oftentimes captured by the membership to a certain function space. One of the core questions for an analysis of a model is the…

The efficient design of continuous freeform surfaces, which transform a given source into an arbitrary target intensity, remains a challenging problem. A popular approach are ray-mapping methods, where first a ray mapping between the…

We derive three-dimensional integrable mappings which have two invariants.

Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one…

Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…

We study the classical weighted perfect matchings problem for bipartite graphs or sometimes referred to as the assignment problem, i.e., given a weighted bipartite graph $G = (U\cup V,E)$ with weights $w : E \rightarrow \mathcal{R}$ we are…

Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine…

The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…

The purpose of this work is to examine the structure of optimal dual fusion frames and get more exibility in the use of dual fusion frames for erasures of subspaces. We deal with optimal dual fusion frames with respect to different…

For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a…

We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the…

For a given graph $G$, the mutual-visibility problem asks for the largest set of vertices $M \subseteq V(G)$ with the property that for any pair of vertices $u,v \in M$ there exists a shortest $u,v$-path of $G$ that does not pass through…