This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
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...
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...