A Fast Suffix-Sorting Algorithm.
Rudolf AhlswedeBernhard BalkenholChristian DeppeMartin FröhlichPublished in: GTIT-C (2006)
Keyphrases
- cost function
- detection algorithm
- times faster
- learning algorithm
- experimental evaluation
- optimal solution
- search space
- high accuracy
- improved algorithm
- segmentation algorithm
- computational cost
- dynamic programming
- recognition algorithm
- k means
- computational complexity
- significant improvement
- preprocessing
- computationally efficient
- theoretical analysis
- optimization algorithm
- classification algorithm
- matching algorithm
- simulated annealing
- tree structure
- expectation maximization
- image compression
- np hard
- face recognition