An Entropy-Based Bound for the Computational Complexity of a Switched System.
Benoît LegatPablo A. ParriloRaphaël M. JungersPublished in: IEEE Trans. Autom. Control. (2019)
Keyphrases
- computational complexity
- worst case
- upper bound
- lower bound
- np complete
- error bounds
- high computational complexity
- low complexity
- computational efficiency
- np hard
- computational cost
- decision problems
- memory requirements
- special case
- information systems
- markov random field
- vc dimension
- explanatory power
- motion vectors
- computationally efficient
- bit rate
- artificial intelligence
- motion estimation
- multiresolution
- multiscale
- search engine