A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm.
Palash SarkarShashank SinghPublished in: ASIACRYPT (1) (2016)
Keyphrases
- computational complexity
- cost function
- high accuracy
- detection algorithm
- experimental evaluation
- dynamic programming
- preprocessing
- improved algorithm
- selection algorithm
- optimization algorithm
- synthetic and real images
- recognition algorithm
- computational cost
- computationally efficient
- computational efficiency
- theoretical analysis
- initial set
- input data
- matching algorithm
- single pass
- estimation algorithm
- method reduces the number
- significant improvement
- k means
- worst case
- objective function
- detection method
- segmentation method
- classification algorithm
- probabilistic model
- high efficiency
- convergence rate
- clustering method
- tree structure
- randomized algorithm
- energy function
- similarity measure
- classification method
- support vector machine svm
- optimization method
- fine tuning
- clustering algorithm
- reconstruction method
- learning algorithm
- memory requirements
- random selection
- em algorithm
- segmentation algorithm
- expectation maximization
- neural network
- pairwise
- search space
- closed form
- special case
- support vector machine