Sciweavers

1390 search results - page 149 / 278
» Computing the depth of a flat
Sort
View
EGH
2005
Springer
15 years 9 months ago
GPU-accelerated high-quality hidden surface removal
High-quality off-line rendering requires many features not natively supported by current commodity graphics hardware: wide smooth filters, high sampling rates, order-independent ...
Daniel Wexler, Larry Gritz, Eric Enderton, Jonatha...
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
15 years 6 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
WSCG
2004
137views more  WSCG 2004»
15 years 5 months ago
Robust Range Image Registration using a Common Plane
This paper presents a method for the registration of range image pairs that were captured from different locations. The proposed approach assumes that a common 3D plane is least v...
Joachim Bauer, Konrad F. Karner, Andreas Klaus, Ro...
GRAPHICSINTERFACE
2000
15 years 5 months ago
High-Quality Interactive Lumigraph Rendering Through Warping
We introduce an algorithm for high-quality, interactive light field rendering from only a small number of input images with dense depth information. The algorithm bridges the gap ...
Hartmut Schirmacher, Wolfgang Heidrich, Hans-Peter...
130
Voted
DM
2010
77views more  DM 2010»
15 years 4 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna