Sciweavers

16844 search results - page 3299 / 3369
» How to Design Programs
Sort
View
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
15 years 10 months ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
ECOOPW
1999
Springer
15 years 10 months ago
Providing Policy-Neutral and Transparent Access Control in Extensible Systems
Extensible systems, such as Java or the SPIN extensible operating system, allow for units of code, or extensions, to be added to a running system in almost arbitrary fashion. Exte...
Robert Grimm, Brian N. Bershad
ESSLLI
1999
Springer
15 years 10 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
HIPC
1999
Springer
15 years 10 months ago
Process Migration Effects on Memory Performance of Multiprocessor
Abstract. In this work we put into evidence how the memory performance of a WebServer machine may depend on the sharing induced by process migration. We considered a shared-bus sha...
Pierfrancesco Foglia, Roberto Giorgi, Cosimo Anton...
ICS
1999
Tsinghua U.
15 years 10 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...
« Prev « First page 3299 / 3369 Last » Next »