Sciweavers

6897 search results - page 1204 / 1380
» Parallelization of Modular Algorithms
Sort
View
VISUALIZATION
1998
IEEE
15 years 9 months ago
Hierarchical volume analysis and visualization based on morphological operators
One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. Th...
Christoph Lürig, Thomas Ertl
ASPLOS
1992
ACM
15 years 9 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
SIGGRAPH
1994
ACM
15 years 9 months ago
FBRAM: a new form of memory optimized for 3D graphics
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
Michael F. Deering, Stephen A. Schlapp, Michael G....
146
Voted
IWMM
1992
Springer
100views Hardware» more  IWMM 1992»
15 years 9 months ago
Scalable Distributed Garbage Collection for Systems of Active Objects
Abstract. Automatic storage management is important in highly parallel programming environments where large numbers of objects and processes are being constantly created and discar...
Nalini Venkatasubramanian, Gul Agha, Carolyn L. Ta...
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 9 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
« Prev « First page 1204 / 1380 Last » Next »