A Linear Time and Space Algorithm to Regonize Interval Orders.
Philippe BaldyMichel MorvanPublished in: Discret. Appl. Math. (1993)
Keyphrases
- worst case
- search space
- learning algorithm
- high accuracy
- computational cost
- computational complexity
- preprocessing
- solution space
- dynamic programming
- cost function
- detection algorithm
- particle swarm optimization
- experimental evaluation
- np hard
- times faster
- distance transform
- improved algorithm
- suffix array
- computationally efficient
- higher dimensional
- data sets
- linear programming
- upper bound
- probabilistic model
- significant improvement
- k means
- objective function
- simulated annealing
- optimization algorithm
- multi objective
- matching algorithm
- convex hull
- convergence rate
- recognition algorithm
- lower bound
- video sequences
- reinforcement learning