Login / Signup

A parallel longest common subsequence algorithm in UPC.

Bryan M. FranklinSteven Seidel
Published in: SpringSim (2010)
Keyphrases
  • computational complexity
  • longest common subsequence
  • dynamic programming
  • worst case
  • objective function
  • k means
  • pattern recognition
  • support vector
  • high dimensional
  • upper bound