Sciweavers

2479 search results - page 14 / 496
» A Computational Theory of Working Memory
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
ICALP
2005
Springer
14 years 1 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
ACPC
1999
Springer
13 years 11 months ago
Hardware and Software Aspects for 3-D Wavelet Decomposition on Shared Memory MIMD Computers
In this work we discuss hardware and software aspects of parallel 3-D wavelet/subband decomposition on shared memory MIMD computers. Experimental results are conducted on a SGI POW...
Rade Kutil, Andreas Uhl
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
AISC
1998
Springer
13 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson