Sciweavers

2035 search results - page 391 / 407
» Working memory
Sort
View
ISHPC
2000
Springer
14 years 1 months ago
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...
LCPC
2000
Springer
14 years 1 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
14 years 1 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
VLDB
1995
ACM
89views Database» more  VLDB 1995»
14 years 1 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
GROUP
2009
ACM
14 years 1 months ago
GroupMind: supporting idea generation through a collaborative mind-mapping tool
Collaborative brainstorming can be a challenging but important part of creative group problem solving. Mind-mapping has the potential to enhance the brainstorming process but has ...
Patrick C. Shih, David H. Nguyen, Sen H. Hirano, D...