A competitive algorithm in searching for many edges in a hypergraph.
Ting ChenFrank K. HwangPublished in: Discret. Appl. Math. (2007)
Keyphrases
- improved algorithm
- high accuracy
- dynamic programming
- np hard
- cost function
- learning algorithm
- preprocessing
- probabilistic model
- times faster
- detection algorithm
- segmentation algorithm
- significant improvement
- objective function
- k means
- experimental evaluation
- weighted graph
- convergence rate
- worst case
- computational complexity
- similarity measure
- matching algorithm
- spanning tree
- image sequences
- directed graph
- optimization algorithm
- optimal solution
- theoretical analysis
- expectation maximization
- scheduling problem
- genetic algorithm
- computational cost
- search space