Login / Signup

A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem.

Yves F. Verhoeven
Published in: Theor. Comput. Sci. (2006)
Keyphrases
  • lower bound
  • learning algorithm
  • computational cost
  • upper bound
  • worst case
  • computationally efficient
  • machine learning algorithms
  • data sets
  • data structure
  • significant improvement
  • theoretical analysis