Sciweavers

3373 search results - page 346 / 675
» Linear transformations on codes
Sort
View
IPCO
2001
117views Optimization» more  IPCO 2001»
15 years 5 months ago
Pruning by Isomorphism in Branch-and-Cut
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 ...
François Margot
EJC
2008
15 years 4 months ago
Deforming Meyer sets
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...
Jeong-Yup Lee, Robert V. Moody
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 3 months ago
Non-negative matrix factorization with sparseness constraints
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...
Patrik O. Hoyer
MVA
2000
273views Computer Vision» more  MVA 2000»
15 years 3 months ago
A compact algorithm for rectification of stereo pairs
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
SIAMJO
2000
116views more  SIAMJO 2000»
15 years 3 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
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...
John E. Mitchell