A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.
Michael DrmotaDaniel PanarioPublished in: Des. Codes Cryptogr. (2002)
Keyphrases
- detection algorithm
- theoretical analysis
- computational cost
- np hard
- learning algorithm
- dynamic programming
- times faster
- optimal solution
- worst case
- significant improvement
- experimental evaluation
- cost function
- search space
- computational complexity
- path planning
- tree structure
- matching algorithm
- computationally efficient
- simulated annealing
- k means
- similarity measure
- convex hull
- recognition algorithm
- estimation algorithm
- computational efficiency
- high accuracy
- classification algorithm
- optimization algorithm
- expectation maximization
- preprocessing
- objective function
- face recognition