Sciweavers

2520 search results - page 214 / 504
» The complexity of approximating entropy
Sort
View
CGF
2008
137views more  CGF 2008»
15 years 6 months ago
Real-Time Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
P. Guerrero, Stefan Jeschke, Michael Wimmer
JOLLI
2006
123views more  JOLLI 2006»
15 years 5 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
AUTOMATICA
2004
125views more  AUTOMATICA 2004»
15 years 5 months ago
Hamiltonian discretization of boundary control systems
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
Goran Golo, Viswanath Talasila, Arjan van der Scha...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 5 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
CVPR
2011
IEEE
15 years 2 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell