Explore >> Select a destination
|
You are here 
|
galowicz.de | ||
| | | | |
www.jeremykun.com
|
|
| | | | | 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$. | |
| | | | |
marcospereira.me
|
|
| | | | | In this post we summarize the math behind deep learning and implement a simple network that achieves 85% accuracy classifying digits from the MNIST dataset. | |
| | | | |
0fps.net
|
|
| | | | | When I was younger I invested a lot of time into studying geometric algebra. Geometric algebra is a system where you can add, subtract and multiply oriented linear subspaces like lines and hyperplanes (cf.Grassmanian). These things are pretty important if you're doing geometry, so it's worth it to learn many ways to work with them.... | |
| | | | |
nhigham.com
|
|
| | | The pseudoinverse is an extension of the concept of the inverse of a nonsingular square matrix to singular matrices and rectangular matrices. It is one of many generalized inverses, but the one most useful in practice as it has a number of special properties. The pseudoinverse of a matrix $latex A\in\mathbb{C}^{m\times n}$ is an $latex... | ||
