Sciweavers

1015 search results - page 89 / 203
» The data locality of work stealing
Sort
View
MMMACNS
2001
Springer
15 years 10 months ago
Dynamic Group Key Management Protocol
If multicast communication appears as the most efficient way to send data to a group of participants, it presents also more vulnerabilities to attacks and requires services such as...
Ghassan Chaddoud, Isabelle Chrisment, André...
COLT
1998
Springer
15 years 10 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
DSN
2004
IEEE
15 years 10 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
CASCON
2006
210views Education» more  CASCON 2006»
15 years 7 months ago
Accelerating marching cubes with graphics hardware
For large data sets in medicine and science, efficient isosurface extraction and rendering is crucial for interactive visualization. Previous GPU acceleration techniques have been...
Gunnar Johansson, Hamish Carr
GRAPHICSINTERFACE
2000
15 years 7 months ago
Multiscale Shaders for the Efficient Realistic Rendering of Pine-Trees
The frame of our work is the efficient realistic rendering of scenes containing a huge amount of data for which an a priori knowledge is available. In this paper, we present a new...
Alexandre Meyer, Fabrice Neyret