A Quasi-Linear Time Algorithm Deciding Whether Weak Büchi Automata Reading Vectors of Reals Recognize Saturated Languages.
Arthur MilchiorPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- dynamic programming
- experimental evaluation
- times faster
- worst case
- matching algorithm
- preprocessing
- optimization algorithm
- computational cost
- optimal solution
- expectation maximization
- probabilistic model
- k means
- computational complexity
- simulated annealing
- np complete
- cost function
- pattern matching
- expressive power
- vector space
- convex hull
- convergence rate
- principal components
- recognition algorithm