Multi-armed bandits a simple but very powerful framework for algorithms that make
decisions over time under uncertainty. An enormous body of work has accumulated over the …

Developing algorithms for sensor networks-and proving their correctness and performance-
requires simplifying but still realistic models. This paper surveys various models in use today …

We study the calculation of exact p-values for a large class of nonsharp null hypotheses
about treatment effects in a setting with data from experiments involving members of a single …

We present a tree data structure for fast nearest neighbor operations in general n-point
metric spaces (where the data set consists of n points). The data structure requires O (n) …

A basic fact in spectral graph theory is that the number of connected components in an
undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of …

In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence of choices.
In each round it chooses from a time-invariant set of alternatives and receives the payoff …

Random Projection Trees and Low Dimensional Manifolds Page 1 Random Projection Trees
and Low Dimensional Manifolds Sanjoy Dasgupta UC San Diego dasgupta@cs.ucsd.edu …

Given a metric space, the (k, z)-clustering problem consists of finding k centers such that the
sum of the of distances raised to the power z of every point to its closest center is minimized …

A/B testing is a standard approach for evaluating the effect of online experiments; the goal is
to estimate theaverage treatment effect'of a new feature or condition by exposing a sample …

We design novel, asymptotically more efficient data structures and algorithms for programs
whose data access patterns exhibit some degree of predictability. To this end, we propose …