We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...