53327 search results - page 10531 / 10666 » or 2007 |
CC
2007
Springer
13 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 9 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
CC
2007
Springer
13 years 9 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
CG
2007
Springer
13 years 9 months ago
2007
Springer
In this paper, we propose novel GPU accelerated algorithms for interactive point-based rendering (PBR) and high-quality shading of transparent point surfaces. By introducing the c...
CGA
2007
13 years 9 months ago
2007
abstract painting and practice can benefit information visualization—even though the two fields have significantly different objectives. This comparison reflects the spirit of ...