Sciweavers

5326 search results - page 920 / 1066
» On what we can ensure
Sort
View
IPPS
2005
IEEE
16 years 34 min ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 12 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
WPES
2005
ACM
15 years 12 months ago
Maintaining privacy on derived objects
Protecting privacy means to ensure users that access to their personal data complies with their preferences. However, information can be manipulated in order to derive new objects...
Nicola Zannone, Sushil Jajodia, Fabio Massacci, Du...
IPPS
2003
IEEE
15 years 11 months ago
BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....
FSTTCS
2003
Springer
15 years 11 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh