(Short Paper) A Faster Constant-Time Algorithm of CSIDH Keeping Two Points.
Hiroshi OnukiYusuke AikawaTsutomu YamazakiTsuyoshi TakagiPublished in: IWSEC (2019)
Keyphrases
- improved algorithm
- learning algorithm
- dynamic programming
- segmentation algorithm
- particle swarm optimization
- theoretical analysis
- cost function
- optimization algorithm
- matching algorithm
- objective function
- search space
- evolutionary algorithm
- k means
- times faster
- convex hull
- experimental evaluation
- computational cost
- detection algorithm
- memory efficient
- computationally efficient
- worst case
- significant improvement
- high dimensional
- optimal solution
- input data
- feature points
- simulated annealing
- data sets
- preprocessing
- keypoints
- tree structure
- computational complexity
- search algorithm
- decision trees
- feature selection
- polygonal approximation
- computationally demanding