5 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 1 cited
The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling
Dana Ron, Gilad Tsur
We study a basic problem of approximating the size of an unknown set in a known universe . We consider two versions of the problem. In both versions the algorithm can specif…
cs.CC2013★ 1 cited
Acquaintance Time of a Graph
Itai Benjamini, Igor Shinkar, Gilad Tsur
We define the following parameter of connected graphs. For a given graph we place one agent in each vertex of . Every pair of agents sharing a common edge is declared to be…
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…