Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths.
Sung Kwon KimPublished in: IEICE Trans. Inf. Syst. (2015)
Keyphrases
- learning algorithm
- tree structure
- k means
- cost function
- dynamic programming
- preprocessing
- detection algorithm
- search space
- optimization algorithm
- objective function
- shortest path problem
- graph structure
- recognition algorithm
- probabilistic model
- computational cost
- np hard
- significant improvement
- simulated annealing
- particle swarm optimization
- segmentation algorithm
- markov random field
- matching algorithm
- edge information
- computational complexity