107 search results - page 13 / 22 » Random sampling and approximation of MAX-CSP problems |
VLDB
2004
ACM
14 years 27 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
ALGORITHMICA
2008
13 years 7 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
MP
2002
13 years 7 months ago
2002
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...