Sciweavers

1816 search results - page 94 / 364
» Trace oblivious computation
Sort
View
RELMICS
2009
Springer
14 years 3 months ago
Foundations of Concurrent Kleene Algebra
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
AFRIGRAPH
2010
ACM
14 years 2 months ago
Exploring the use of glossy light volumes for interactive global illumination
From the literature, it is known that backward polygon beam tracing and other light volume methods are well suited to gather path coherency from specular scattering surfaces. This...
Bernardt Duvenhage, Kadi Bouatouch, Derrick G. Kou...
SPAA
2009
ACM
14 years 5 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
TVCG
2010
165views more  TVCG 2010»
13 years 5 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
CCS
2010
ACM
14 years 5 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...