A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree.
Wei DingGuoliang XuePublished in: COCOA (2) (2010)
Keyphrases
- detection algorithm
- learning algorithm
- graph structure
- tree structure
- preprocessing
- computational complexity
- search space
- cost function
- dynamic programming
- experimental evaluation
- computational cost
- high accuracy
- improved algorithm
- minimum spanning tree
- optimal solution
- significant improvement
- theoretical analysis
- objective function
- times faster
- binary tree
- unordered trees
- convergence rate
- b tree
- linear programming
- video sequences
- similarity measure
- feature selection