算法知识点
kyoma comment: 难度不分先后, 求补充对应英文
Member from Supernatural Psychology Association
CartoonGAN: Generative Adversarial Networks for Photo Cartoonization [Chen et al., CVPR18] paper link
PR links(Introcued below, both have been merged)
This blog is just a simple note for the project Timeseries query language extension during this summer.
文文问怎么推导点到超平面的距离, 除了把它想成Least squares问题外, 这也是一个在给定约束条件下求极值的问题, 顺便测试一下hexo数学符号显示怎么样,新博客的第一篇就写下使用Lagrange multiplier来求这个条件极值问题吧.