10 citations · 10 across the 1 of their papers we have counts for
3 papers
math.OC2017
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…
cs.GR2017★ 10 cited
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…
math.DS2016
Spatial Recurrence for Ergodic Fractal Measures
Nadav Dym
We discuss an invertible version of Furstenberg's `Ergodic CP Shift Systems'. We show that the explicit regularity of these dynamical systems with respect to magnification of measu…