1021 search results - page 34 / 205 » Fast Approximate PCPs |
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
GRAPHICSINTERFACE
1996
13 years 11 months ago
1996
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...
WEA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
SIAMCOMP
1998
13 years 9 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...
TVCG
2011
13 years 5 months ago
2011
—This paper presents a fast parallel method to solve the radiative transport equation in inhomogeneous participating media. We apply a novel approximation scheme to find a good ...