Sign in

On Submodular Set Cover Problems for Near-Optimal Online Kernel Basis Selection.

Hrusikesha PradhanAlec KoppelKetan Rajawat
Published in: ICASSP (2022)
Keyphrases
  • greedy algorithm
  • set cover
  • genetic algorithm
  • feature space
  • optimization problems
  • online learning
  • objective function
  • optimal solution
  • support vector
  • constraint satisfaction problems
  • approximation algorithms