Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms.
Guy LouchardPublished in: Theor. Comput. Sci. (1999)
Keyphrases
- asymptotic properties
- learning algorithm
- databases
- theoretical analysis
- times faster
- orders of magnitude
- search algorithm
- data structure
- significant improvement
- computational cost
- optimization problems
- database
- memory requirements
- recently developed
- computational efficiency
- machine learning
- computationally efficient
- sufficient conditions
- computer vision
- higher order
- multi class
- state space
- image processing