Abstract In this document we make a brief review of memory management and DMA considerations in case of common SCI hardware and the Virtual Interface Architecture. On this basis we...
Mario Trams, Wolfgang Rehm, Daniel Balkanski, Stan...
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pa...
Lee Calcraft, Rod Adams, Weiliang Chen, Neil Davey
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...