A Polynomial Algorithm for Codes Based on Directed Graphs.
Andrei V. KelarevPublished in: CATS (2006)
Keyphrases
- detection algorithm
- directed graph
- times faster
- optimization algorithm
- cost function
- dynamic programming
- experimental evaluation
- optimal solution
- learning algorithm
- shortest path problem
- significant improvement
- high accuracy
- similarity measure
- matching algorithm
- linear programming
- k means
- np hard
- search space
- preprocessing
- computational complexity
- maximum flow
- computational cost
- simulated annealing
- particle swarm optimization
- expectation maximization
- random walk
- evolutionary algorithm
- clustering method
- tree structure
- objective function