On Locality-Sensitive Orderings and
Proximity in the age of distraction: Robust approximate
nearest neighbor search.
Talk in CG seminar in Tel-Aviv
Beyond planarity: On
geometric intersection graphs, 1/11/16.
Presented in SODA 2016.
- Talk in discrete math seminar in KAIST.
Time Approximation Scheme for Sparse Subsets of
SoCG talk (6/10/2014):
haystacks (and similar structures) in geometry
Barriers in Computational Complexity II.
August 29, 2010. Princeton, NJ.
(The talk is different than the one given in TAU.)
school - Madalgo, Aarhus, Denmark. August 16-19, 2010.
Constructions of SSPDs and their Applications.
15-June-2010, in SoCG 2010, Snowbird, Utah.
Finding haystacks (and similar structures) in
23-May-2010. in SharirFest, Tel-Aviv University.
the Frechet Distance for Realistic Curves in Near Linear
Algorithms for Maximum Independent Set of Pseudo-Disks
June 10, 2009, Aarhus, Denmark. SoCG 09.
On set cover in geometric settings
A survey on geometric set covering problem and what is known
On Approximate Halfspace Range Counting and Relative
eps-Approximations, with B. Aronov and M. Sharir. SoCG
Paper (unmerged version),
Embeddings of Surfaces, Curves, and Moving Points in
Euclidean Space, with P. Agarwal and H. Yu. SoCG 07.
and slides source.
Fast Construction of Nets in Low Dimensional Metrics,
and Their Applications, with Manor Mendel. SoCG
Smaller Coresets for
k-Means Clustering, with Akash Kushal. SoCG 05.
and slides source.
and Shape Fitting in High Dimensions. In IST seminar in
The coresets omnibus. In
EWCG 2005 spring
How fast is the k-means
B. Sadri. In SODA 05.
On Approximating the Depth and
Related Problems, with B. Aronov. In SODA 05.
Coresets for k-Means and k-Median
Clustering and their Applications, 2004.
On Finding a Guard that Sees Most and
a Shop that Sells Most, 2004.
On Coresets and Shape Fitting in High Dimensions, 2003.
"The problem received the title of `Buridan's sheep.' The biological
code was taken from a young merino sheep, by the Casparo-Karpov
method, at a moment when the sheep was between two feeding troughs
full of mixed fodder. This code, along with additional data about
sheep in general, was fed into CODD. The machine was required: a) to
predict which trough the merino would choose, and b) to give the
psychophysiological basis for this choice."
-- The mystery of the hind leg, Arkady and Boris Strugatsky
Last modified: Mon Jun 16 07:02:02 CDT 2014