Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.
Mikael HammarBengt J. NilssonPublished in: FCT (1997)
Keyphrases
- worst case
- average case
- error bounds
- data structure
- lower bound
- significant improvement
- image processing
- recently developed
- orders of magnitude
- computationally efficient
- theoretical analysis
- machine learning algorithms
- upper bound
- data mining algorithms
- computational efficiency
- computationally expensive
- times faster
- computational complexity
- decision trees
- machine learning