Sciweavers

464 search results - page 12 / 93
» On the Computational Complexity of Hierarchical Radiosity
Sort
View
MST
2011
207views Hardware» more  MST 2011»
14 years 4 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
CGF
2008
168views more  CGF 2008»
14 years 9 months ago
Interactive Global Illumination for Deformable Geometry in CUDA
Interactive global illumination for fully deformable scenes with dynamic relighting is currently a very elusive goal in the area of realistic rendering. In this work we propose a ...
Arne Schmitz, Markus Tavenrath, Leif Kobbelt
BMCBI
2007
172views more  BMCBI 2007»
14 years 9 months ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
LICS
2005
IEEE
15 years 3 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey