Sciweavers

887 search results - page 37 / 178
» A Time for Choosing
Sort
View
CHI
1998
ACM
13 years 12 months ago
Student Readers' Use of Library Documents: Implications for Library Technologies
We report on a study of graduate students conducting research in libraries, focusing on how they extract and record information as they read. By examining their information record...
Kenton O'Hara, Fiona Smith, William M. Newman, Abi...
HPDC
1994
IEEE
13 years 11 months ago
Network Partitioning of Data Parallel Computations
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
Jon B. Weissman, Andrew S. Grimshaw
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
13 years 11 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
ISCA
1990
IEEE
68views Hardware» more  ISCA 1990»
13 years 11 months ago
Maximizing Performance in a Striped Disk Array
Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is to stripe data across many disks. ...
Peter M. Chen, David A. Patterson
PLDI
1995
ACM
13 years 11 months ago
Tile Size Selection Using Cache Organization and Data Layout
When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...
Stephanie Coleman, Kathryn S. McKinley