Sciweavers

785 search results - page 137 / 157
» Binary Join Trees
Sort
View
LICS
2003
IEEE
15 years 2 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
RT
2001
Springer
15 years 2 months ago
Realistic Reflections and Refractions on Graphics Hardware with Hybrid Rendering and Layered Environment Maps
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
Ziyad S. Hakura, John M. Snyder
87
Voted
VVS
2000
IEEE
171views Visualization» more  VVS 2000»
15 years 2 months ago
Fast CSG voxelization by frame buffer pixel mapping
This paper describes a fast algorithm for the volume conversion and rendering of CSG models constructed from both geometric and volumetric primitives. Using 3D texture mapping and...
Shiaofen Fang, Duoduo Liao
SPAA
1998
ACM
15 years 1 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 1 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar