Sciweavers

1450 search results - page 22 / 290
» Complexity of Inference in Graphical Models
Sort
View
RT
2001
Springer
14 years 1 days ago
Realistic Reflections and Refractions on Graphics Hardware with Hybrid Rendering and Layered Environment Maps
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
Ziyad S. Hakura, John M. Snyder
CGF
2000
150views more  CGF 2000»
13 years 7 months ago
Perceptual Principles and Computer Graphics
Now that technology allows us to present photorealistic animations of scenically lit objects acting in realtime, the problem of computer graphics has changed from making displays ...
Jon May
EMNLP
2009
13 years 5 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
AAAI
2011
12 years 7 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
JMLR
2010
148views more  JMLR 2010»
13 years 2 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...