290 search results - page 42 / 58 » Lattice-based computation of Boolean functions |
ENTCS
2010
13 years 5 months ago
2010
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
VMV
2003
13 years 9 months ago
2003
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
RELMICS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...