Sciweavers

5275 search results - page 884 / 1055
» Computing by observing
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 8 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
SC
2000
ACM
15 years 8 months ago
Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling
The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP cluster...
D. S. Henty
CVPR
1997
IEEE
15 years 8 months ago
Learning bilinear models for two-factor problems in vision
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
William T. Freeman, Joshua B. Tenenbaum
SC
1992
ACM
15 years 8 months ago
Willow: A Scalable Shared Memory Multiprocessor
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
John K. Bennett, Sandhya Dwarkadas, Jay A. Greenwo...
SI3D
1992
ACM
15 years 8 months ago
NPSNET: Constructing a 3D Virtual World
The development of 3D visual simulation systemson inexpensive, commercially available graphics workstations is occurring today and will be commonplace in the near future. Such sys...
Michael Zyda, David R. Pratt, James G. Monahan, Ka...