Login / Signup

An iterative algorithm for locating the minimal eigenvector of a symmetric matrix.

Daniel R. FuhrmannBede Liu
Published in: ICASSP (1984)
Keyphrases
  • learning algorithm
  • np hard
  • dynamic programming
  • k means
  • worst case
  • graph structure
  • semidefinite programming
  • canonical form