A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm.
Palash SarkarShashank SinghPublished in: IACR Cryptol. ePrint Arch. (2016)
Keyphrases
- computational complexity
- high accuracy
- preprocessing
- experimental evaluation
- cost function
- selection algorithm
- significant improvement
- improved algorithm
- detection method
- clustering method
- computational cost
- dynamic programming
- recognition algorithm
- optimization algorithm
- objective function
- segmentation algorithm
- k means
- detection algorithm
- theoretical analysis
- estimation algorithm
- initial set
- synthetic and real images
- worst case
- computationally efficient
- classification method
- input data
- high efficiency
- single pass
- fine tuning
- random selection
- similarity measure
- segmentation method
- selection strategy
- computational efficiency
- optimal solution
- classification algorithm
- optimization method
- support vector machine svm
- reconstruction method
- randomized algorithm
- method reduces the number
- closed form
- matching algorithm
- energy function
- em algorithm
- expectation maximization
- probabilistic model
- np hard
- numerically stable
- neural network
- maximum likelihood
- simulated annealing
- denoising
- special case
- search space
- pairwise
- image segmentation