Sciweavers

155 search results - page 20 / 31
» Bounded Arithmetic and Descriptive Complexity
Sort
View
GRAPHICSINTERFACE
1998
13 years 8 months ago
Ray-tracing Procedural Displacement Shaders
Displacement maps and procedural displacement shaders are a widely used approach of specifying geometric detail and increasing the visual complexity of a scene. While it is relati...
Wolfgang Heidrich, Hans-Peter Seidel
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 5 days ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
DSN
2004
IEEE
13 years 11 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
AAAI
2006
13 years 8 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen