290 search results - page 44 / 58 » Lattice-based computation of Boolean functions |
DAC
1994
ACM
15 years 3 months ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
DIS
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
110
click to vote
STACS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
105
click to vote
TCS
2010
14 years 10 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...