A polynomial-time algorithm for median-closed semilinear constraints.
Manuel BodirskyMarcello MaminoPublished in: CoRR (2018)
Keyphrases
- computational complexity
- detection algorithm
- dynamic programming
- experimental evaluation
- worst case
- learning algorithm
- preprocessing
- constrained optimization
- times faster
- expectation maximization
- search space
- cost function
- multiple constraints
- matching algorithm
- particle swarm optimization
- simulated annealing
- np hard
- k means
- scheduling problem
- similarity measure
- objective function
- neural network
- queueing networks
- image segmentation
- geometric constraints
- convex hull
- image sequences
- clustering method
- lower bound
- linear programming
- high accuracy
- probabilistic model
- upper bound