A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms.
Michael D. GrigoriadisBahman KalantariPublished in: Inf. Process. Lett. (1986)
Keyphrases
- worst case
- lower bound
- computational complexity
- upper bound
- learning algorithm
- complexity measures
- lower complexity
- high computational complexity
- lower and upper bounds
- computational cost
- significant improvement
- pattern matching
- matching algorithm
- search space
- computer vision
- itemsets
- computationally efficient
- complexity analysis
- search algorithm
- object matching
- objective function