What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics.
Vladimir A. UspenskyAlexei L. SemenovPublished in: Algorithms in Modern Mathematics and Computer Science (1979)
Keyphrases
- learning algorithm
- theoretical analysis
- times faster
- computational complexity
- computationally efficient
- computational efficiency
- worst case
- computational cost
- single pass
- significant improvement
- solution quality
- recently developed
- convergence rate
- exhaustive search
- algorithms require
- synthetic and real world datasets
- provably convergent
- preprocessing
- np hard
- related algorithms
- particle swarm optimization
- dynamic programming
- algorithm has been developed
- k means
- space complexity
- filtering algorithm
- computationally intensive
- matching algorithm
- cost function
- empirical analyses
- incremental algorithms
- benchmark problems
- iterative algorithms
- computational geometry
- decision trees
- nearest neighbour
- maximum flow
- optimal solution
- synthetic and real datasets
- image processing algorithms
- hybrid algorithm
- segmentation algorithm
- classification algorithm