We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...