An effective algorithm to compute Mandelbrot sets in parameter planes.
Antonio GarijoXavier JarqueJordi VilladelpratPublished in: Numer. Algorithms (2017)
Keyphrases
- computational cost
- optimization algorithm
- computational complexity
- dynamic programming
- preprocessing
- k means
- improved algorithm
- cost function
- detection algorithm
- high accuracy
- matching algorithm
- times faster
- np hard
- estimation algorithm
- optimal solution
- objective function
- experimental evaluation
- lower bound
- worst case
- input data
- parameter tuning
- control parameters
- data sets
- theoretical analysis
- computationally efficient
- expectation maximization
- image registration
- mobile robot
- significant improvement
- search space
- reinforcement learning
- neural network