Sciweavers

11231 search results - page 1967 / 2247
» Digging for Data Structures
Sort
View
125
Voted
IPPS
1996
IEEE
15 years 7 months ago
ECO: Efficient Collective Operations for Communication on Heterogeneous Networks
PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections o...
Bruce Lowekamp, Adam Beguelin
122
Voted
VISUALIZATION
1996
IEEE
15 years 7 months ago
Illustrating Transparent Surfaces with Curvature-Directed Strokes
Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures -as in phot...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
126
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 7 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
PLDI
1996
ACM
15 years 7 months ago
Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutat...
Martin C. Rinard, Pedro C. Diniz
131
Voted
SIGGRAPH
1996
ACM
15 years 7 months ago
Rendering Parametric Surfaces in Pen and Ink
This paper presents new algorithms and techniques for rendering parametric free-form surfaces in pen and ink. In particular, we introduce the idea of "controlled-density hatc...
Georges Winkenbach, David Salesin
« Prev « First page 1967 / 2247 Last » Next »