Probabilistic analyses of the plain multiple gcd algorithm.
Valérie BerthéLoïck LhoteBrigitte ValléePublished in: J. Symb. Comput. (2016)
Keyphrases
- dynamic programming
- detection algorithm
- input data
- k means
- computational complexity
- learning algorithm
- theoretical analysis
- optimal solution
- recognition algorithm
- probabilistic model
- optimization algorithm
- cost function
- preprocessing
- objective function
- posterior probability
- significant improvement
- experimental evaluation
- data sets
- bayesian framework
- times faster
- expectation maximization
- matching algorithm
- worst case
- context free parsing
- memory requirements
- improved algorithm
- segmentation algorithm
- simulated annealing
- high accuracy
- computational cost
- np hard
- data structure
- similarity measure
- neural network