A Fast Minimum Degree Algorithm and Matching Lower Bound.
Robert CummingsMatthew FahrbachAnimesh FatehpuriaPublished in: CoRR (2019)
Keyphrases
- markov random field
- matching algorithm
- lower bound
- optimal solution
- learning algorithm
- np hard
- dynamic programming
- times faster
- objective function
- detection algorithm
- probabilistic model
- square error
- optimization algorithm
- linear programming
- high accuracy
- experimental evaluation
- worst case
- significant improvement
- k means
- pattern matching
- computational complexity
- matching process
- string matching
- neural network
- particle swarm optimization
- theoretical analysis
- bayesian networks
- lower and upper bounds