Sciweavers

341 search results - page 17 / 69
» Decision Complexity in Dynamic Geometry
Sort
View
SI3D
2006
ACM
14 years 2 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
TOG
2008
180views more  TOG 2008»
13 years 8 months ago
Interactive relighting of dynamic refractive objects
We present a new technique for interactive relighting of dynamic refractive objects with complex material properties. We describe our technique in terms of a rendering pipeline in...
Xin Sun, Kun Zhou, Eric J. Stollnitz, Jiaoying Shi...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen