Sciweavers

2555 search results - page 493 / 511
» Quantifiers and Working Memory
Sort
View
LCPC
2000
Springer
13 years 11 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
DCC
1995
IEEE
13 years 11 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
13 years 11 months ago
Streamlining Data Cache Access with Fast Address Calculation
For many programs, especially integer codes, untolerated load instruction latencies account for a significant portion of total execution time. In this paper, we present the desig...
Todd M. Austin, Dionisios N. Pnevmatikatos, Gurind...
PARA
1995
Springer
13 years 11 months ago
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS. The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
Jaeyoung Choi, Jack Dongarra, Susan Ostrouchov, An...
VLDB
1995
ACM
89views Database» more  VLDB 1995»
13 years 11 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton