Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs.
Khaled M. ElbassioniPublished in: CoRR (2019)
Keyphrases
- computational cost
- learning algorithm
- optimization problems
- data sets
- classification algorithm
- theoretical analysis
- computationally efficient
- computational complexity
- computer vision
- real time
- data structure
- objective function
- bayesian networks
- similarity measure
- data mining
- computational efficiency
- computationally expensive
- convergence rate
- decomposition methods