The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
A linear deformation of a Meyer set M in Rd is the image of M under a group homomorphism of the group [M] generated by M into Rd . We provide a necessary and sufficient condition f...
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
We present a linear rectification algorithm for general, unconstrained stereo rigs. The algorithm takes the two perspective projection matrices of the original cameras, and compute...
Andrea Fusiello, Emanuele Trucco, Alessandro Verri
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...