Login / Signup

Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints.

Sandip DasAyan NandySwami Sarvottamananda
Published in: CALDAM (2016)
Keyphrases
  • worst case
  • learning algorithm
  • computational complexity
  • computationally intensive
  • convex constraints
  • motion estimation
  • linear program