Sciweavers

9736 search results - page 67 / 1948
» How Fast Can We Compute Products
Sort
View
SIGGRAPH
1994
ACM
15 years 8 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
BMCBI
2010
132views more  BMCBI 2010»
15 years 4 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
CLUSTER
2002
IEEE
15 years 9 months ago
Scalable Resource Management in High Performance Computers
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...
DSN
2009
IEEE
15 years 11 months ago
Fast memory state synchronization for virtualization-based fault tolerance
Virtualization provides the possibility of whole machine migration and thus enables a new form of fault tolerance that is completely transparent to applications and operating syst...
Maohua Lu, Tzi-cker Chiueh
MICCAI
2008
Springer
16 years 5 months ago
Physical-Space Refraction-Corrected Transmission Ultrasound Computed Tomography Made Computationally Practical
Abstract. Transmission Ultrasound Computed Tomography (CT) is strongly affected by the acoustic refraction properties of the imaged tissue, and proper modeling and correction of th...
Shengying Li, Klaus Mueller, Marcel Jackowski, ...