Login / Signup

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem.

Lasse Bergroth
Published in: SPIRE (2005)
Keyphrases
  • dynamically updated
  • beam search
  • solving problems
  • machine learning
  • combinatorial optimization
  • image sequences
  • lower bound
  • training set
  • linear programming
  • orders of magnitude
  • domain independent
  • joint estimation