We consider the task of aligning two sets of points in high dimension, which has many
applications in natural language processing and computer vision. As an example, it was …

Many shape and image processing tools rely on computation of correspondences between
geometric domains. Efficient methods that stably extract" soft" matches in the presence of …

Inverse problems correspond to a certain type of optimization problems formulated over
appropriate input distributions. Recently, there has been a growing interest in understanding …

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has
received wide-spread attention from both theoretical and applied communities over the past …

Many inverse problems are formulated as optimization problems over certain appropriate
input distributions. Recently, there has been a growing interest in understanding the …

Establishing point correspondences between shapes is extremely challenging as it involves
both finding sets of semantically persistent feature points, as well as their combinatorial …

Classical graph matching aims to find a node correspondence between two unlabeled
graphs of known topologies. This problem has a wide range of applications, from matching …

Problems related to graph matching and isomorphisms are very important both from a
theoretical and practical perspective, with applications ranging from image and video …

We describe general heuristics to approximately solve a wide variety of problems with
convex objective and decision variables from a nonconvex set. The heuristics, which employ …

An isomorphism between two graphs is a bijection between their vertices that preserves the
edges. We consider the problem of determining whether two finite undirected weighted …