A Simple and Near-Optimal Algorithm for Directed Expander Decompositions.
Aurelio L. SulserMaximilian Probst GutenbergPublished in: CoRR (2024)
Keyphrases
- high accuracy
- improved algorithm
- cost function
- learning algorithm
- detection algorithm
- recognition algorithm
- experimental evaluation
- search space
- preprocessing
- np hard
- dynamic programming
- objective function
- bayesian networks
- computational complexity
- experimental study
- theoretical analysis
- particle swarm optimization
- times faster
- data sets
- computational cost
- optimal solution
- single pass
- k means
- selection algorithm
- memory requirements
- estimation algorithm
- minimum length
- optimization algorithm
- input data
- linear programming
- simulated annealing
- worst case
- denoising
- significant improvement
- search algorithm
- image segmentation