An efficient algorithm for the synthesis of fully consistent graphs.
Martin KreißigBin YangPublished in: ICASSP (2012)
Keyphrases
- learning algorithm
- computational complexity
- dynamic programming
- computationally efficient
- high accuracy
- computational cost
- np hard
- experimental evaluation
- expectation maximization
- times faster
- matching algorithm
- detection algorithm
- k means
- preprocessing
- improved algorithm
- optimal solution
- theoretical analysis
- recognition algorithm
- graph clustering
- search space
- globally optimal
- memory efficient
- graph isomorphism
- graph structure
- convergence rate
- optimization algorithm
- segmentation algorithm
- np complete
- graphical models
- significant improvement
- lower bound
- search algorithm
- clustering algorithm