A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.
Antoine BossardKeiichi KanekoShietung PengPublished in: Comput. J. (2011)
Keyphrases
- experimental evaluation
- initial set
- np hard
- tree structure
- optimization algorithm
- root node
- optimal solution
- learning algorithm
- search space
- dynamic programming
- computational cost
- graph structure
- detection algorithm
- optimal path
- pairwise
- shortest path problem
- simulated annealing
- linear programming
- segmentation algorithm
- computational complexity
- clustering method
- matching algorithm
- solution space
- spanning tree
- decomposition algorithm
- disjoint subsets
- input data
- recognition algorithm
- expectation maximization
- worst case
- cost function
- preprocessing
- objective function
- image segmentation
- decision trees