An algorithm for identifying the abstract syntax of graph-based diagrams.
Ateret Anaby-TavorDavid AmidAmit FisherHarold OssherRachel K. E. BellamyMatthew CalleryMichael DesmondSophia KrasikovTova RothIan SimmondsJacqueline de VriesPublished in: VL/HCC (2009)
Keyphrases
- significant improvement
- experimental evaluation
- detection algorithm
- computational cost
- theoretical analysis
- times faster
- classification algorithm
- computationally efficient
- high accuracy
- graph based algorithm
- selection algorithm
- expectation maximization
- neural network
- probabilistic model
- dynamic programming
- k means
- particle swarm optimization
- worst case
- optimization algorithm
- np hard
- cost function
- improved algorithm
- data streams