Fast Computation of the Exact Number of Magic Series with an Improved Montgomery Multiplication Algorithm.
Yukimasa SugizakiDaisuke TakahashiPublished in: ICA3PP (2) (2020)
Keyphrases
- dynamic programming
- computational complexity
- objective function
- detection algorithm
- public key cryptosystems
- np hard
- worst case
- space complexity
- simulated annealing
- expectation maximization
- segmentation algorithm
- parallel implementation
- learning algorithm
- lower bound
- optimal solution
- binary images
- memory requirements
- fpga implementation