A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties.
David LubiczDamien RobertPublished in: J. Symb. Comput. (2015)
Keyphrases
- np hard
- improved algorithm
- detection algorithm
- computational complexity
- experimental evaluation
- high accuracy
- multiscale
- times faster
- similarity measure
- preprocessing
- k means
- computationally efficient
- learning algorithm
- theoretical analysis
- optimization algorithm
- experimental study
- recognition algorithm
- estimation algorithm
- single pass
- expectation maximization
- neural network
- dynamic programming
- simulated annealing
- linear programming
- clustering method
- denoising
- tree structure
- matching algorithm
- path planning
- computational cost
- convergence rate
- segmentation algorithm
- selection algorithm
- cost function
- hardware implementation
- objective function
- graph cuts