Search
Search Results
-
Text Matching as Time Series Matching
Text matching plays a fundamental and vital role in many aspects of natural language processing (NLP), where multi-level text matching is the most...
-
Robust Matching for Teams
We examine a hedonic model featuring uncertain production costs. The aim is to determine equilibrium prices and wages that facilitate the pairing of...
-
Approximation properties of slice-matching operators
Iterative slice-matching procedures are efficient schemes for transferring a source measure to a target measure, especially in high dimensions. These...
-
Matching Complexes of Trees and Applications of the Matching Tree Algorithm
A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G . The topology of matching complexes is...
-
Matching Minors
In this final chapter of Part I, we bring together ideas of bicontractions of vertices of degree two and deletions of removable classes described in...
-
Outlier Robust Feature Correspondence by Learning Based Matching Process
Feature correspondence is a crucial aspect of various computer vision and robot vision tasks. Unlike traditional optimization-based matching...
-
The Perfect Matching Polytope
A geometrical object of great interest in the theory of combinatorial optimization is the perfect matching polytope of a graph. It turns out that...
-
Matching Covered Graphs
This book is primarily concerned with matching covered graphs which were briefly introduced at the end of Section 1.3. We begin our exploration of...
-
Fast topological signal identification and persistent cohomological cycle matching
Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are...
-
Matching pursuit with unbounded parameter domains
In various applications, the adoption of optimal energy matching pursuit with dictionary elements is common. When the dictionary elements are indexed...
-
Bipartite perfect matching as a real polynomial
We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full total...
-
Uniquely Restricted Matching Extendable Graphs
A matching M of a graph G is called uniquely restricted if M is a unique perfect matching of the subgraph induced by M -saturated vertex set. A...
-
A fuzzy model for NMT word alignment using quasi-perfect matching
In this article, first, the concept of quasi-perfect matching in a fuzzy graph is introduced. In addition to using these types of matching in...
-
Intersecting ellipses induced by a max-sum matching
For an even set of points in the plane, choose a max-sum matching , that is, a perfect matching maximizing the sum of Euclidean distances of its...
-
Efficient joint object matching via linear programming
Joint object matching, also known as multi-image matching, namely, the problem of finding consistent partial maps among all pairs of objects within a...
-
Constrained many-to-many point matching in two dimensions
In the minimum-weight many-to-many point matching problem, we are given a set R of red points and a set B of blue points in the plane, of total size N ...
-
Fast normalized cross-correlation for template matching with rotations
Normalized cross-correlation is the reference approach to carry out template matching on images. When it is computed in Fourier space, it can handle...
-
Inapproximability of shortest paths on perfect matching polytopes
We consider the computational problem of finding short paths in the skeleton of the perfect matching polytope of a bipartite graph. We prove that...
-
-
The Matching Lattice and Optimal Ear Decompositions
The objective of this chapter is to present a characterization of the matching lattice of a matching covered graph. Our approach to this...