Sciweavers

1282 search results - page 248 / 257
» Practical Loss-Resilient Codes
Sort
View
EUROCRYPT
2010
Springer
14 years 8 days ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
ICS
1999
Tsinghua U.
13 years 11 months ago
Improving the performance of bristled CC-NUMA systems using virtual channels and adaptivity
Current high-end parallel systems achieve low-latency, highbandwidth network communication through the use of aggressive design techniques and expensive mechanical and electrical ...
José F. Martínez, Josep Torrellas, J...
SSD
1999
Springer
106views Database» more  SSD 1999»
13 years 11 months ago
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information ...
Christian Böhm, Gerald Klump, Hans-Peter Krie...
PLDI
2010
ACM
13 years 11 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski