Sciweavers

4536 search results - page 627 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
DGCI
2000
Springer
15 years 11 months ago
Deformable Modeling for Characterizing Biomedical Shape Changes
Abstract. We present a new algorithm for modeling and characterizing shape changes in 3D image sequences of biomedical structures. Our algorithm tracks the shape changes of the obj...
Matthieu Ferrant, Benoit M. Macq, Arya Nabavi, Sim...
PPOPP
1999
ACM
15 years 11 months ago
MagPIe: MPI's Collective Communication Operations for Clustered Wide Area Systems
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
Thilo Kielmann, Rutger F. H. Hofman, Henri E. Bal,...
RT
1998
Springer
15 years 11 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
RTCSA
2000
IEEE
15 years 10 months ago
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement share...
Håkan Sundell, Philippas Tsigas