Sciweavers

7129 search results - page 916 / 1426
» Approximation Algorithms for Treewidth
Sort
View
142
Voted
CGF
2008
122views more  CGF 2008»
15 years 5 months ago
Accurate Shadows by Depth Complexity Sampling
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Vincent Forest, Loïc Barthe, Mathias Paulin
CGF
2008
138views more  CGF 2008»
15 years 5 months ago
Geometry-Aware Framebuffer Level of Detail
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
Lei Yang, Pedro V. Sander, Jason Lawrence
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 5 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 5 months ago
Query Strategies for Evading Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
DATAMINE
2010
175views more  DATAMINE 2010»
15 years 5 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...