Sciweavers

405 search results - page 43 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
RT
2005
Springer
15 years 4 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
Global Illumination Compensation for Spatially Augmented Reality
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
Yu Sheng, Theodore C. Yapo, Barbara Cutler
83
Voted
MOBICOM
2005
ACM
15 years 4 months ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
STACS
2009
Springer
15 years 5 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
FLAIRS
2001
15 years 14 days ago
Detection of Inconsistencies in Complex Product Configuration Data Using Extended Propositional SAT-Checking
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
Carsten Sinz, Andreas Kaiser, Wolfgang Küchli...