Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms.
Sergey S. FedinAlexander S. KulikovPublished in: IWPEC (2004)
Keyphrases
- upper bound
- upper and lower bounds
- theoretical analysis
- lower bound
- computationally efficient
- significant improvement
- computational cost
- lower and upper bounds
- machine learning algorithms
- computationally hard
- bayesian networks
- data structure
- worst case
- optimization problems
- recently developed
- benchmark datasets
- data mining techniques
- data sets
- learning algorithm
- neural network