Sciweavers

6300 search results - page 339 / 1260
» We have it easy, but do we have it right
Sort
View
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
15 years 6 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
TOOLS
1999
IEEE
15 years 6 months ago
On Creation, Equality and the Object Model
In designing languages, we strive for consistency and elegance. In object-oriented languages, simple data types have always been a problem in that they do not quite fit in with th...
Michael Kölling, John Rosenberg
MCMASTER
1993
15 years 6 months ago
A Systolizing Compilation Scheme for Nested Loops with Linear Bounds
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
Michael Barnett, Christian Lengauer
RT
2000
Springer
15 years 5 months ago
Dynamic Acceleration Structures for Interactive Ray Tracing
Acceleration structures used for ray tracing have been designed and optimized for efficient traversal of static scenes. As it becomes feasible to do interactive ray tracing of movi...
Erik Reinhard, Brian E. Smits, Charles D. Hansen
SMILE
2000
Springer
15 years 5 months ago
Volumetric Warping for Voxel Coloring on an Infinite Domain
Starting with a set of calibrated photographs taken of a scene, voxel coloring algorithms reconstruct three-dimensional surface models on a finite spatial domain. In this paper, we...
Gregory G. Slabaugh, Thomas Malzbender, W. Bruce C...