tnch

6 ms·

1. 1.▲
   Training DNN in O(1) Memory Using Random Matrices(arxiv.org)

   2 points by tnch 2y ago|0 comments
2. 2.▲
   by tnch 2y ago

   From wikipedia https://en.wikipedia.org/wiki/Carving_width#Related_paramete... : “[…], it can be shown that for any graph, the carving width is greater than or equal to half the branch width, and is less than or equal t
3. 3.▲
   by tnch 2y ago

   A graph is fundamental notion in computer science because it allows us to model numerous interesting real life problems. Trees are special kind of graphs that are structurally very simple thus many interesting problems are very easy to solv
4. 4.▲
   by tnch 2y ago

   The Haskell course at ITMO from Serokell is pure gold, imo: https://github.com/jagajaga/FP-Course-ITMO