A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold.
Charilaos EfthymiouPublished in: SIAM J. Comput. (2016)
Keyphrases
- monte carlo
- learning algorithm
- optimal solution
- objective function
- detection algorithm
- expectation maximization
- preprocessing
- k means
- experimental evaluation
- thresholding algorithm
- times faster
- significant improvement
- computational cost
- input data
- particle swarm optimization
- computational complexity
- theoretical analysis
- optimization algorithm
- data structure
- clustering method
- recognition algorithm
- similarity measure
- data sets
- cost function
- sampling algorithm
- markov chain monte carlo
- convergence rate
- bayesian networks
- simulated annealing
- high accuracy
- np hard