A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties.
David FreemanPublished in: Pairing (2008)
Keyphrases
- times faster
- np hard
- learning algorithm
- preprocessing
- dynamic programming
- computational complexity
- experimental evaluation
- theoretical analysis
- expectation maximization
- classification algorithm
- matching algorithm
- k means
- bayesian networks
- single pass
- memory requirements
- clustering method
- simulated annealing
- estimation algorithm
- high accuracy
- space complexity
- search space
- improved algorithm
- particle swarm optimization
- selection algorithm
- convergence rate
- computationally efficient
- input data
- significant improvement
- similarity measure