The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
Hans-Joachim BöckenhauerJuraj HromkovicDennis KommSacha KrugJasmin SmulaAndreas SprockPublished in: COCOON (2013)
Keyphrases
- lower bound
- objective function
- detection method
- experimental evaluation
- computational cost
- upper bound
- neural network
- pairwise
- dynamic programming
- synthetic data
- branch and bound
- classification method
- pattern matching
- distance function
- support vector machine svm
- bit rate
- cost function
- significant improvement
- learning algorithm