Performance of the Metropolis algorithm on a disordered tree: the Einstein relation
Pascal MaillardOfer ZeitouniPublished in: CoRR (2013)
Keyphrases
- learning algorithm
- computational cost
- tree structure
- np hard
- detection algorithm
- recognition algorithm
- experimental evaluation
- neural network
- optimization algorithm
- preprocessing
- objective function
- significant improvement
- improved algorithm
- computationally efficient
- classification algorithm
- dynamic programming
- k means
- spanning tree
- simulated annealing
- optimal solution
- clustering method
- bayesian networks
- bayesian framework
- minimum spanning tree
- b tree
- times faster
- theoretical analysis
- markov random field
- worst case
- probability distribution
- probabilistic model