2479 search results - page 276 / 496 » A Computational Theory of Working Memory |
148
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
191
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
155
click to vote
SC
1994
ACM
15 years 10 months ago
1994
ACM
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
190
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
215
click to vote
APCSAC
2000
IEEE
15 years 10 months ago
2000
IEEE
Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs. This paper describes...