Fixing Shin's Reading Algorithm for Peirce's Existential Graphs.
Frithjof DauPublished in: Diagrams (2006)
Keyphrases
- detection algorithm
- optimization algorithm
- significant improvement
- experimental evaluation
- times faster
- computational complexity
- preprocessing
- search space
- dynamic programming
- improved algorithm
- learning algorithm
- linear programming
- graph structure
- np hard
- adjacency graph
- high accuracy
- weighted graph
- clustering method
- graph isomorphism
- computationally efficient
- np complete
- particle swarm optimization
- cost function
- k means
- video sequences
- objective function
- image sequences
- social networks