Efficient Algorithm for Tate Pairing of Composite Order.
Yutaro KiyomuraTsuyoshi TakagiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2014)
Keyphrases
- learning algorithm
- single pass
- improved algorithm
- cost function
- matching algorithm
- computationally intensive
- high efficiency
- highly efficient
- recognition algorithm
- k means
- np hard
- experimental evaluation
- optimization algorithm
- high accuracy
- computationally efficient
- data sets
- objective function
- search space
- dynamic programming
- memory requirements
- memory efficient
- computational complexity
- times faster
- pattern matching
- clustering method
- path planning
- energy function
- particle swarm optimization
- preprocessing
- support vector machine
- similarity measure
- image processing
- space requirements
- linear programming