The Polya algorithm in sequence spaces.
José M. QuesadaJ. Fernández-OchoaJuan Martínez-MorenoJorge BustamantePublished in: J. Approx. Theory (2005)
Keyphrases
- dynamic programming
- improved algorithm
- computational complexity
- preprocessing
- detection algorithm
- optimization algorithm
- computational cost
- experimental evaluation
- theoretical analysis
- k means
- estimation algorithm
- computationally efficient
- cost function
- learning algorithm
- clustering method
- times faster
- matching algorithm
- single pass
- np hard
- significant improvement
- search space
- search algorithm
- similarity measure
- sequence alignment
- sequence matching
- long sequences
- forward backward
- classification algorithm
- tree structure
- expectation maximization
- maximum likelihood
- linear programming
- high accuracy
- video sequences
- objective function