2354 search results - page 195 / 471 » Randomness, Stochasticity and Approximations |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
WDAG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
ISBI
2004
IEEE
14 years 10 months ago
2004
IEEE
Our goal is to analyze regularized image reconstruction methods such as penalized likelihood with respect to the performance of the Channelized Hotelling Observer (CHO) in the tas...
RANDOM
2001
Springer
14 years 2 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
RANDOM
2001
Springer
14 years 2 months ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...