4894 search results - page 166 / 979 » The Guarding Problem - Complexity and Approximation |
151
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
151
click to vote
SIAMCO
2002
15 years 6 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
166
click to vote
PAMI
2011
15 years 1 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
137
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
151
click to vote
ALT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...