A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs.
Fabrizio d'AmorePaolo Giulio FranciosaPublished in: Int. J. Comput. Geom. Appl. (2018)
Keyphrases
- dynamic programming
- search space
- detection algorithm
- experimental evaluation
- learning algorithm
- expectation maximization
- improved algorithm
- high accuracy
- optimization algorithm
- segmentation algorithm
- hardware implementation
- np hard
- k means
- preprocessing
- computational complexity
- linear programming
- graph structure
- graph model
- minimum spanning tree
- recognition algorithm
- ant colony optimization
- particle swarm optimization
- computational cost
- cost function
- optimal solution