We consider the problem of partitioning a set of m points in the n-dimensional Euclidean
space into k clusters (usually m and n are variable, while k is fixed), so as to minimize the …

In many applications, the data consist of (or may be naturally formulated as) an m*n matrix A.
It is often of interest to find a low-rank approximation to A, ie, an approximation D to the …

The field of property testing originated in work on program checking, and has evolved into
an established and very active research area. In this work, we survey the developments of …

We consider the problem of verifying the identity of a distribution: Given the description of a
distribution over a discrete finite or countably infinite support, p=(p_1,p_2,...), how many …

In many applications, the data consist of (or may be naturally formulated as) an m*n matrix A
which may be stored on disk but which is too large to be read into random access memory …

The recent explosion of interest in graph cut methods in computer vision naturally spawns
the question: what energy functions can be minimized via graph cuts? This question was first …

For years, the conventional wisdom [7, 22] has been that the continued stability of the
Internet depends on the widespread deployment of" socially responsible" congestion …

Hypothesis testing plays a central role in statistical inference, and is used in many settings
where privacy concerns are paramount. This work answers a basic question about privately …

We consider the problem of approximating the support size of a distribution from a small
number of samples, when each element in the distribution appears with probability at least …

In the turnstile model of data streams, an underlying vector x∈{--m,--m+ 1,..., m--1, m} n is
presented as a long sequence of positive and negative integer updates to its coordinates. A …