Sciweavers

1279 search results - page 82 / 256
» Fast Implementations of Automata Computations
Sort
View
SI3D
2009
ACM
14 years 3 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
BMCBI
2010
218views more  BMCBI 2010»
13 years 9 months ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber
SIAMSC
2010
159views more  SIAMSC 2010»
13 years 3 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
IPPS
2007
IEEE
14 years 3 months ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer
HPCC
2007
Springer
14 years 3 months ago
A Fast Disaster Recovery Mechanism for Volume Replication Systems
Disaster recovery solutions have gained popularity in the past few years because of their ability to tolerate disasters and to achieve the reliability and availability. Data replic...
Yanlong Wang, Zhanhuai Li, Wei Lin