2496 search results - page 3 / 500 » On covering by translates of a set |
ESA
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
ASP
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
EMNLP
2007
13 years 7 months ago
2007
Given multiple translations of the same source sentence, how to combine them to produce a translation that is better than any single system output? We propose a hierarchical syste...
SIAMCOMP
1998
13 years 5 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...
SPAA
2010
ACM
13 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...