An algorithm to reduce the complexity required to convolve finite length sequences using the Hirschman optimal transform (HOT).
Victor E. DeBrunnerEwa MatusiakPublished in: ICASSP (2) (2003)
Keyphrases
- optimal solution
- times faster
- worst case
- dynamic programming
- optimization algorithm
- learning algorithm
- globally optimal
- computational complexity
- theoretical analysis
- improved algorithm
- experimental evaluation
- k means
- hidden markov models
- path planning
- long sequences
- locally optimal
- objective function
- space complexity
- exhaustive search
- convergence rate
- detection algorithm
- segmentation algorithm
- linear programming
- cost function
- clustering method
- tree structure
- significant improvement
- recognition algorithm
- preprocessing
- neural network
- optimal parameters
- computational cost
- mobile robot