Refinements of the k-tree Algorithm for the Generalized Birthday Problem.
Ivica NikolicYu SasakiPublished in: ASIACRYPT (2) (2015)
Keyphrases
- learning algorithm
- experimental evaluation
- tree structure
- high accuracy
- binary tree
- computational cost
- np hard
- clustering method
- detection algorithm
- expectation maximization
- computational complexity
- preprocessing
- convergence rate
- particle swarm optimization
- dynamic programming
- significant improvement
- optimal solution
- objective function
- worst case
- similarity measure
- linear programming
- computationally efficient
- k means
- search space
- improved algorithm
- recognition algorithm
- graph structure
- genetic algorithm
- times faster
- matching algorithm
- decision trees
- ant colony optimization
- lower bound