xinyu04

导航

2022年5月23日 #

Deep Learning Week7 Notes

摘要: 1. Tansposed Convolution Consider 1d convolution with kernel \(k\): \[ \begin{align} y_i &= (x\circledast k)_i\\ &=\sum_a x_{i+a-1}k_a\\ &=\sum_u x_uk 阅读全文

posted @ 2022-05-23 22:56 Blackzxy 阅读(16) 评论(0) 推荐(0) 编辑

LeetCode 1130 Minimum Cost Tree From Leaf Values 思维

摘要: Given an array arr of positive integers, consider all binary trees such that: Each node has either 0 or 2 children; The values of arr correspond to th 阅读全文

posted @ 2022-05-23 17:36 Blackzxy 阅读(22) 评论(0) 推荐(0) 编辑