/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

yetanothermathprogrammingconsultant.blogspot.com
| | hadrienj.github.io
2.2 parsecs away

Travel
| | This post will introduce you to special kind of matrices: the identity matrix and the inverse matrix. We will use Python/Numpy as a tool to get a better intu...
| | liorsinai.github.io
3.9 parsecs away

Travel
| | Derivation of the backpropagation equations for layer normalization.
| | www.jeremykun.com
3.6 parsecs away

Travel
| | For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$.
| | shivasurya.me
13.5 parsecs away

Travel
| Tech blog on cyber security, android security, android development, mobile security, sast, offensive security, oscp walkthrough, reverse engineering.