• These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.

    这两类算法是在ML算法基础上放松约束条件,将问题转化为可在多项式时间内解决的凸优化问题。

    youdao

  • These two algorithms relax the constraints of ML algorithm and transform it into a convex problem which can be efficiently solved with a polynomial time.

    这两类算法是在ML算法基础上放松约束条件,将问题转化为可在多项式时间内解决的凸优化问题。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定