Sciweavers

290 search results - page 15 / 58
» Lattice-based computation of Boolean functions
Sort
View
ICCV
2011
IEEE
13 years 11 months ago
Superpixels via Pseudo-Boolean Optimization
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
Yuhang Zhang, Richard Hartley, John Mashford, Stew...
DAC
2004
ACM
16 years 20 days ago
A recursive paradigm to solve Boolean relations
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
David Bañeres, Jordi Cortadella, Michael Ki...
ERSHOV
2003
Springer
15 years 5 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
14 years 10 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
DAC
1994
ACM
15 years 3 months ago
Boolean Matching Using Generalized Reed-Muller Forms
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
Chien-Chung Tsai, Malgorzata Marek-Sadowska