Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.

Published in: Algorithmica (2003)

Keyphrases

neural network
case study
maximum number
linear algebra
artificial intelligence
image processing
pairwise
semidefinite
computer vision
sufficient conditions
low rank
probabilistic relaxation