A fast randomized geometric algorithm for computing Riemann-Roch spaces.
Aude Le GluherPierre-Jean SpaenlehauerPublished in: Math. Comput. (2020)
Keyphrases
- learning algorithm
- computational complexity
- dynamic programming
- detection algorithm
- computational cost
- monte carlo
- preprocessing
- experimental evaluation
- k means
- expectation maximization
- worst case
- theoretical analysis
- cost function
- selection algorithm
- search space
- recognition algorithm
- times faster
- improved algorithm
- convergence rate
- input data
- simulated annealing
- np hard
- evolutionary algorithm
- genetic algorithm
- geometric constraints
- estimation algorithm
- randomized algorithm
- data sets
- consistency check
- tree structure
- computationally efficient
- high accuracy
- probabilistic model
- data streams
- similarity measure