Sciweavers

2479 search results - page 117 / 496
» A Computational Theory of Working Memory
Sort
View
PDC
2004
ACM
14 years 1 months ago
Participatory design with individuals who have amnesia
We present experiences and insights into participatory design with individuals who have anterograde amnesia and therefore have extreme difficulty storing new memories. We discuss ...
Mike Wu, Brian Richards, Ronald Baecker
ANCS
2009
ACM
13 years 5 months ago
Design and performance analysis of a DRAM-based statistics counter array architecture
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
Haiquan (Chuck) Zhao, Hao Wang, Bill Lin, Jun (Jim...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 7 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
STORAGESS
2005
ACM
14 years 1 months ago
An electric fence for kernel buffers
Improper access of data buffers is one of the most common errors in programs written in assembler, C, C++, and several other languages. Existing programs and OSs frequently acces...
Nikolai Joukov, Aditya Kashyap, Gopalan Sivathanu,...
IPPS
2008
IEEE
14 years 2 months ago
Automatic generation of a parallel sorting algorithm
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing ...
Brian A. Garber, Daniel Hoeflinger, Xiaoming Li, M...