A Maze Routing-Based Algorithm for ML-OARST with Pre-Selecting and Re-Building Steiner Points.
Kuen-Wey LinYeh-Sheng LinYih-Lang LiRung-Bin LinPublished in: ACM Great Lakes Symposium on VLSI (2017)
Keyphrases
- optimization algorithm
- selection algorithm
- objective function
- times faster
- high accuracy
- learning algorithm
- np hard
- computational cost
- convex hull
- experimental evaluation
- significant improvement
- optimal solution
- computational complexity
- cost function
- similarity measure
- convergence rate
- probabilistic model
- worst case
- preprocessing
- linear programming
- input data
- maximum likelihood
- expectation maximization
- matching algorithm
- data structure
- feature space
- search space
- recognition algorithm
- k means