Algorithm for faster computation of non-zero graph based invariants.
Vazeerudeen Abdul HameedSiti Mariyam ShamsuddinMaslina DarusAnca L. RalescuPublished in: Neurocomputing (2014)
Keyphrases
- preprocessing
- learning algorithm
- improved algorithm
- dynamic programming
- times faster
- computationally efficient
- memory efficient
- computational complexity
- worst case
- experimental evaluation
- detection algorithm
- matching algorithm
- theoretical analysis
- ant colony optimization
- particle swarm optimization
- computationally demanding
- graph based algorithm
- simulated annealing
- computational cost
- np hard
- cost function
- evolutionary algorithm
- convex hull
- convergence rate
- recognition algorithm
- graph structure
- search space
- optimal solution
- graph construction
- similarity measure
- feature selection