Sciweavers

11211 search results - page 1815 / 2243
» Data Structures
Sort
View
CGF
2004
151views more  CGF 2004»
15 years 6 months ago
Deferred Splatting
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
CGF
2000
110views more  CGF 2000»
15 years 6 months ago
Directional Discretized Occluders for Accelerated Occlusion Culling
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
Fausto Bernardini, James T. Klosowski, Jihad El-Sa...
CORR
2002
Springer
93views Education» more  CORR 2002»
15 years 6 months ago
Secure History Preservation Through Timeline Entanglement
A secure timeline is a tamper-evident historic record of the states through which a system goes throughout its operational history. Secure timelines can help us reason about the t...
Petros Maniatis, Mary Baker
ENTCS
2002
131views more  ENTCS 2002»
15 years 6 months ago
Automatic Generation of Language-based Tools
Many tools have been constructed using different formal methods to process various parts of a language specification (e.g., scanner generators, parser generators and compiler gene...
Pedro Rangel Henriques, Maria João Varanda ...
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
« Prev « First page 1815 / 2243 Last » Next »