Login / Signup

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.

Sandip DasAyan NandySwami Sarvottamananda
Published in: Discret. Appl. Math. (2020)
Keyphrases
  • convex constraints
  • learning algorithm
  • worst case
  • computational complexity
  • computationally intensive
  • probability distribution
  • natural images