Sciweavers

84 search results - page 13 / 17
» Faster Relief Mapping using the Secant Method
Sort
View
SIGGRAPH
2000
ACM
14 years 12 days ago
A fast relighting engine for interactive cinematic lighting design
We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical in...
Reid Gershbein, Pat Hanrahan
CEC
2007
IEEE
14 years 2 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld
NIPS
2008
13 years 9 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 2 months ago
Estimation of non-stationary Markov Chain transition models
— Many decision systems rely on a precisely known Markov Chain model to guarantee optimal performance, and this paper considers the online estimation of unknown, nonstationary Ma...
Luca F. Bertuccelli, Jonathan P. How
DEXA
2007
Springer
135views Database» more  DEXA 2007»
14 years 2 months ago
Semantic Grouping of Social Networks in P2P Database Settings
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...