An algorithm reconstructing convex lattice sets.
Sara BrunettiAlain DauratPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- times faster
- dynamic programming
- learning algorithm
- improved algorithm
- computational cost
- high accuracy
- theoretical analysis
- cost function
- computational complexity
- np hard
- detection algorithm
- optimization algorithm
- optimal solution
- lattice structure
- k means
- globally optimal
- similarity measure
- convex hull
- segmentation algorithm
- simulated annealing
- experimental evaluation
- preprocessing
- search space
- expectation maximization
- particle swarm optimization
- neural network
- tree structure
- classification algorithm
- objective function
- scheduling problem
- recognition algorithm