Sciweavers

130 search results - page 13 / 26
» A New Change of Variables for Efficient BRDF Representation
Sort
View
UAI
2004
13 years 9 months ago
Probabilistic Index Maps for Modeling Natural Signals
One of the major problems in modeling natural signals is that signals with very similar structure may locally have completely different measurements, e.g., images taken under diff...
Nebojsa Jojic, Yaron Caspi, Manuel Reyes-Gomez
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
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...
DAC
2004
ACM
14 years 8 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara