35 citations · 114 across the 25 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 5 cited
Tight Approximation of Image Matching
Simon Korman, Daniel Reichman, Gilad Tsur
In this work we consider the {\em image matching} problem for two grayscale images, and (where pixel values range from 0 to 1). Our goal is to find an affi…
cs.DS2011★ 1 cited
Recoverable Values for Independent Sets
Uriel Feige, Daniel Reichman
The notion of {\em recoverable value} was advocated in work of Feige, Immorlica, Mirrokni and Nazerzadeh [Approx 2009] as a measure of quality for approximation algorithms. There t…