Login / Signup

Near-optimality of greedy set selection in the sampling of graph signals.

Luiz F. O. ChamonAlejandro Ribeiro
Published in: GlobalSIP (2016)
Keyphrases
  • small number
  • random walk
  • directed graph
  • search algorithm
  • spectral analysis
  • dynamic programming
  • worst case