Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula.
Sergei A. AbramovM. PetkovssekPublished in: ISSAC (2005)
Keyphrases
- times faster
- np hard
- dynamic programming
- computational complexity
- experimental evaluation
- preprocessing
- theoretical analysis
- high accuracy
- improved algorithm
- cost function
- computationally efficient
- learning algorithm
- objective function
- tree structure
- detection algorithm
- expectation maximization
- particle swarm optimization
- simulated annealing
- probabilistic model
- k means
- image registration
- optimization algorithm
- computational cost
- ant colony optimization
- significant improvement
- lower bound