1054 search results - page 33 / 211 » Fast Approximated SIFT |
NIPS
2007
14 years 11 months ago
2007
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
SIGMOD
2003
ACM
15 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
14 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
15 years 3 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
14 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...