Sign in

Exploiting Sparsity in Difference-Bound Matrices.

Graeme GangeJorge A. NavasPeter SchachteHarald SøndergaardPeter J. Stuckey
Published in: SAS (2016)
Keyphrases
  • high dimensional
  • upper bound
  • lower bound
  • sparse representation
  • worst case
  • learning algorithm
  • objective function
  • optimal solution
  • error bounds
  • tensor factorization