A Polynomial-time Algorithm to Achieve Extended Justified Representation.
Haris AzizShenwei HuangPublished in: CoRR (2017)
Keyphrases
- computational complexity
- experimental evaluation
- objective function
- worst case
- matching algorithm
- preprocessing
- expectation maximization
- detection algorithm
- dynamic programming
- optimization algorithm
- search space
- significant improvement
- high accuracy
- computational cost
- particle swarm optimization
- tree structure
- np hard
- times faster
- polynomial time approximation
- recognition algorithm
- improved algorithm
- delaunay triangulation
- compact representations
- neural network
- ant colony optimization
- segmentation algorithm
- theoretical analysis
- cost function
- evolutionary algorithm
- optimal solution
- similarity measure
- decision trees
- feature selection