22 citations · 47 across the 35 of their papers we have counts for
4 papers · 1 filter
A Linear Variational Principle for Riemann Mappings and Discrete Conformality
Nadav Dym, Yaron Lipman, Raz Slutsky
We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: it is the…
Sinkhorn Algorithm for Lifted Assignment Problems
Yam Kushinsky, Haggai Maron, Nadav Dym +1
Recently, Sinkhorn's algorithm was applied for approximately solving linear programs emerging from optimal transport very efficiently. This was accomplished by formulating a regula…
Exact Recovery with Symmetries for the Doubly-Stochastic Relaxation
Nadav Dym
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the…
DS++: A flexible, scalable and provably tight relaxation for matching problems
Nadav Dym, Haggai Maron, Yaron Lipman
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are t…