A polynomial algorithm for finding T-span of generalized cacti.
Krzysztof GiaroRobert JanczewskiMichal MalafiejskiPublished in: Discret. Appl. Math. (2003)
Keyphrases
- segmentation algorithm
- learning algorithm
- optimization algorithm
- improved algorithm
- k means
- single pass
- cost function
- worst case
- dynamic programming
- input data
- detection algorithm
- computational cost
- experimental evaluation
- selection algorithm
- search space
- preprocessing
- matching algorithm
- convex hull
- convergence rate
- classification algorithm
- computationally efficient
- particle swarm optimization
- simulated annealing
- probabilistic model
- np hard
- computational complexity
- polynomially bounded
- estimation algorithm
- linear programming
- recognition algorithm
- clustering method
- high accuracy
- optimal solution
- objective function
- reinforcement learning