Linear-time algorithm for sliding tokens on trees.
Erik D. DemaineMartin L. DemaineEli Fox-EpsteinDuc A. HoangTakehiro ItoHirotaka OnoYota OtachiRyuhei UeharaTakeshi YamadaPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- dynamic programming
- detection algorithm
- learning algorithm
- optimization algorithm
- tree structure
- worst case
- preprocessing
- expectation maximization
- computational cost
- np hard
- selection algorithm
- cost function
- segmentation algorithm
- theoretical analysis
- improved algorithm
- computationally efficient
- matching algorithm
- motion estimation
- probabilistic model
- convergence rate
- computational complexity
- data structure
- path planning
- times faster
- genetic algorithm
- binary tree
- input data
- high accuracy
- significant improvement
- search space
- optimal solution
- objective function