An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models.
Suani T. R. PinhoV. A. G. O. de MenesesM. S. P. MunizThierry Petit LobãoPublished in: Comput. Phys. Commun. (2019)
Keyphrases
- learning algorithm
- probabilistic model
- computational cost
- expectation maximization
- detection algorithm
- computationally efficient
- parameter estimation
- np hard
- dynamic programming
- preprocessing
- experimental evaluation
- high accuracy
- search space
- optimization algorithm
- worst case
- matching algorithm
- times faster
- convergence rate
- sequence matching
- hidden markov models
- cost function
- significant improvement
- optimal solution
- simulated annealing
- graphical models
- particle swarm optimization
- similarity measure
- graph cuts
- genetic algorithm
- k means
- computational complexity
- improved algorithm
- reinforcement learning