A reasonable triamantane rearrangement path searched by the selective disource propagation algorithm.
Nobuhide TanakaTadayoshi KanTakeshi IizukaPublished in: J. Chem. Inf. Comput. Sci. (1983)
Keyphrases
- matching algorithm
- preprocessing
- learning algorithm
- detection algorithm
- significant improvement
- experimental evaluation
- computational cost
- improved algorithm
- estimation algorithm
- expectation maximization
- dynamic programming
- np hard
- cost function
- k means
- search space
- computational complexity
- input data
- particle swarm optimization
- segmentation algorithm
- objective function
- memory requirements
- path length
- single pass
- recognition algorithm
- clustering method
- theoretical analysis
- graph cuts
- high accuracy
- similarity measure