A logarithmic time complexity algorithm for pattern searching using product-sum property.
Khalid Mahmood AamirMujahid AbbasStojan RadenovicPublished in: Comput. Math. Appl. (2011)
Keyphrases
- worst case
- computational complexity
- learning algorithm
- objective function
- cost function
- preprocessing
- improved algorithm
- detection algorithm
- optimal solution
- times faster
- matching algorithm
- space complexity
- theoretical analysis
- computationally efficient
- particle swarm optimization
- high accuracy
- dynamic programming
- multi objective
- search space
- input data
- complexity analysis
- optimization algorithm
- experimental evaluation
- clustering algorithm
- approximate pattern matching
- global consistency
- neural network
- convergence rate
- memory requirements
- convex hull
- path planning
- tree structure
- pattern matching
- clustering method
- expectation maximization
- image registration
- computational cost