Quantum Complexity of the Approximation on the Classes B(Wrp([0, 1]d)) and B(Hrp([0, 1]d)).
Peixin YePublished in: ICNC (3) (2008)
Keyphrases
- approximation error
- tractable cases
- complexity measures
- worst case
- computational complexity
- humanoid robot
- approximation algorithms
- error bounds
- quantum computation
- space complexity
- lower bound
- computer vision
- model selection
- neural network
- artificial neural networks
- feature space
- relative error
- video sequences
- feature selection
- error tolerance
- quantum computing
- information retrieval