Algorithm 994: Fast Implementations of the Brouwer-Zimmermann Algorithm for the Computation of the Minimum Distance of a Random Linear Code.
Fernando HernandoFrancisco D. IgualGregorio Quintana-OrtíPublished in: ACM Trans. Math. Softw. (2019)
Keyphrases
- preprocessing
- experimental evaluation
- computational cost
- high accuracy
- optimal solution
- improved algorithm
- recognition algorithm
- detection algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- simulated annealing
- linear complexity
- randomly generated
- segmentation algorithm
- input data
- worst case
- probabilistic model
- search space
- genetic algorithm
- particle swarm optimization
- expectation maximization
- np hard
- k means
- times faster
- lower bound
- computational complexity
- similarity measure
- parallel implementation
- image processing