Sciweavers

11231 search results - page 1984 / 2247
» Digging for Data Structures
Sort
View
143
Voted
SC
1995
ACM
15 years 7 months ago
Detecting Coarse - Grain Parallelism Using an Interprocedural Parallelizing Compiler
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
Mary W. Hall, Saman P. Amarasinghe, Brian R. Murph...
138
Voted
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 7 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
VISUALIZATION
1995
IEEE
15 years 7 months ago
Enhancing Transparent Skin Surfaces with Ridge and Valley Lines
There are many applications that can benefit from the simultaneous display of multiple layers of data. The objective in these cases is to render the layered surfaces in a such way...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
DBPL
1991
Springer
66views Database» more  DBPL 1991»
15 years 7 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
168
Voted
EDBT
1992
ACM
111views Database» more  EDBT 1992»
15 years 7 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
« Prev « First page 1984 / 2247 Last » Next »