373 search results - page 40 / 75 » On Deterministic Approximation of DNF |
136
click to vote
FORTE
2004
15 years 3 months ago
2004
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
148
click to vote
PODS
2012
ACM
13 years 4 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
132
click to vote
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
119
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
116
click to vote
COCO
2006
Springer
15 years 5 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...