On the Complexity and Admissible Parameters of the Crossbred Algorithm in $\mathbb{F}_{q\geq2}$.
João Diogo DuartePublished in: IACR Cryptol. ePrint Arch. (2023)
Keyphrases
- computational complexity
- worst case
- experimental evaluation
- parameter estimation
- improved algorithm
- expectation maximization
- learning algorithm
- times faster
- k means
- space complexity
- computational cost
- optimal solution
- linear complexity
- optimal parameters
- parameter tuning
- recognition algorithm
- matching algorithm
- detection algorithm
- theoretical analysis
- computationally efficient
- cost function
- np hard
- dynamic programming
- simulated annealing
- memory requirements
- levenberg marquardt
- neural network
- state space
- image segmentation
- optimization algorithm
- segmentation algorithm
- linear programming
- input data
- preprocessing
- data structure
- convergence rate
- clustering method
- search space
- evolutionary algorithm
- parameter selection