16159 search results - page 3163 / 3232 » Parallel computing with CUDA |
CC
2007
Springer
14 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 ...
110
click to vote
JMM2
2006
14 years 9 months ago
2006
Abstract-- This paper describes a framework for constructing a three-dimensional immersive environment that can be used for training physical activities. The system is designed to ...
ESWA
2007
14 years 9 months ago
2007
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
SIAMSC
2008
14 years 9 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
SAC
2006
ACM
14 years 9 months ago
2006
ACM
High volume print jobs are getting more common due to the growing demand for personalized documents. In this context, Variable Data Printing (VDP) has become a useful tool for mar...