Sciweavers

4211 search results - page 675 / 843
» A formal approach to MASQ
Sort
View
MICCAI
2009
Springer
16 years 7 months ago
Dynamic Cone Beam Reconstruction Using a New Level Set Formulation
Abstract. This paper addresses an approach toward tomographic reconstruction from rotational angiography data as it is generated by Carms in cardiac imaging. Since the rotational a...
Andreas Keil, Jakob Vogel, Günter Lauritsch, ...
DAC
2003
ACM
16 years 7 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
DAC
2005
ACM
16 years 7 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ICML
2008
IEEE
16 years 7 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
ICML
2006
IEEE
16 years 7 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis