An efficient algorithm for the n-best-strings problem.
Mehryar MohriMichael RileyPublished in: INTERSPEECH (2002)
Keyphrases
- computational complexity
- preprocessing
- k means
- experimental evaluation
- detection algorithm
- improved algorithm
- dynamic programming
- computational cost
- optimization algorithm
- convergence rate
- times faster
- theoretical analysis
- learning algorithm
- distance function
- matching algorithm
- memory requirements
- selection algorithm
- highly efficient
- computationally efficient
- worst case
- np hard
- search space
- optimal solution
- objective function
- particle filter
- particle swarm optimization
- high accuracy
- tree structure
- significant improvement
- data sets