Improving Walker's Algorithm to Run in Linear Time.
Christoph BuchheimMichael JüngerSebastian LeipertPublished in: Graph Drawing (2002)
Keyphrases
- worst case
- improved algorithm
- expectation maximization
- detection algorithm
- optimization algorithm
- preprocessing
- learning algorithm
- single pass
- high accuracy
- dynamic programming
- k means
- search space
- np hard
- experimental evaluation
- computational cost
- similarity measure
- particle swarm optimization
- path planning
- times faster
- recognition algorithm
- theoretical analysis
- neural network
- probabilistic model
- cost function
- image segmentation
- selection algorithm
- significant improvement
- suffix array
- matching algorithm
- classification algorithm
- mathematical model
- objective function
- segmentation algorithm
- computational complexity
- evolutionary algorithm
- motion estimation