An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts.
Kenichi TaniguchiTadao KasamiPublished in: Acta Informatica (1976)
Keyphrases
- computational complexity
- preprocessing
- cost function
- learning algorithm
- theoretical analysis
- input data
- high accuracy
- dynamic programming
- k means
- significant improvement
- minimum length
- optimization algorithm
- convergence rate
- computationally efficient
- lower and upper bounds
- nearest neighbour
- clustering method
- convex hull
- solution space
- expectation maximization
- decomposition algorithm
- computational cost
- boolean expressions
- search space
- lower bound
- initial set
- conflict free
- polynomial time complexity
- improved algorithm
- path planning
- classification algorithm
- segmentation algorithm
- worst case
- probability distribution
- experimental evaluation
- multi objective
- objective function