Sciweavers

557 search results - page 91 / 112
» Useful Transformations in Answer set programming
Sort
View
LISP
2006
160views more  LISP 2006»
13 years 8 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
IPAS
2008
13 years 10 months ago
Multivariate mathematical morphology and Bayesian classifier application to colour and medical images
Multivariate images are now commonly produced in many applications. If their process is possible due to computers power and new programming languages, theoretical difficulties hav...
Arnaud Garcia, Corinne Vachier, Jean-Paul Vall&eac...
PLDI
2003
ACM
14 years 1 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
AAAI
2007
13 years 10 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
TIT
2011
209views more  TIT 2011»
13 years 3 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...