6393 search results - page 260 / 1279 » Randomized Algorithms on the Mesh |
204
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
180
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
167
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
164
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We present a simple randomized construction of size O
165
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...