An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Abstractā Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneļ¬...
Abstract. We present a new method for proving lower bounds in evolutionary computation based on ļ¬tness-level arguments and an additional condition on transition probabilities bet...
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...