Sciweavers

3637 search results - page 184 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
WSCG
2003
142views more  WSCG 2003»
13 years 11 months ago
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
Venceslas Biri, Sylvain Michelin, Didier Arqu&egra...
CGF
2008
227views more  CGF 2008»
13 years 9 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CGF
2008
137views more  CGF 2008»
13 years 9 months ago
Real-Time Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
P. Guerrero, Stefan Jeschke, Michael Wimmer
CONCURRENCY
2008
102views more  CONCURRENCY 2008»
13 years 9 months ago
Dynamic data replication in LCG 2008
To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dy...
Caitriana Nicholson, David G. Cameron, A. T. Doyle...
CVIU
2008
109views more  CVIU 2008»
13 years 9 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios