An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles.
Panagiotis D. AlevizosPublished in: Inf. Process. Lett. (2013)
Keyphrases
- dynamic programming
- detection algorithm
- optimal solution
- worst case
- computational complexity
- k means
- times faster
- closed form
- theoretical analysis
- preprocessing
- improved algorithm
- matching algorithm
- high accuracy
- globally optimal
- np hard
- experimental evaluation
- segmentation algorithm
- optimality criterion
- data sets
- exhaustive search
- expectation maximization
- significant improvement
- learning algorithm
- optimization algorithm
- high speed
- convergence rate
- feature selection
- space complexity
- optimal parameters
- optimal path
- locally optimal
- neural network