This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a query string p, all matches of p with the text can be reported… (More)

For a set S of points in a metric space, a t-spanner is a graph on the points of S such that between any pair of points there is a path in the spanner whose total length is at most t times the actual… (More)

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+µ)-approximation to… (More)

We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data structure has… (More)

2015 IEEE 56th Annual Symposium on Foundations of…

2015

It has long been known that d-dimensional Euclidean point sets admit (1+ε)-stretch spanners with lightness W<sub>E</sub> = ε<sup>-O</sup>(d), that is the total edge weight is at most WE times the… (More)

For a set <i>S</i> of points in ℝ<sup>d</sup>, a t-spanner is a sparse graph on the points of <i>S</i> such that between any pair of points there is a path in the spanner whose total length is at… (More)

Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as string edit and… (More)

We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: we prove the hardness of… (More)