Sciweavers

213 search results - page 36 / 43
» A framework for checking proofs naturally
Sort
View
ECCC
2008
93views more  ECCC 2008»
13 years 7 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
DICS
2006
13 years 9 months ago
Dependable Software
Achieving software reliability takes many complementary techniques, directed at the process or at the products. This survey summarizes some of the most fruitful ideas. 1 OVERVIEW ...
Bertrand Meyer
ICCV
2003
IEEE
14 years 9 months ago
"Perspective Shape from Shading" and Viscosity Solutions
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
Emmanuel Prados, Olivier D. Faugeras
PPDP
2009
Springer
14 years 2 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
14 years 18 days ago
Leveraging dominators for preprocessing QBF
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...