/explore
|
You are here 
|
craigmbooth.com | ||
| | | | |
blog.vstelt.dev
[AI summary] The article explains the process of building a neural network from scratch in Rust, covering forward and backward propagation, matrix operations, and code implementation. |
|
| | | | | ||
| | | | |
mathenchant.wordpress.com
A few weeks ago I was minding my own business, peacefully reading a well-written and informative article about artificial intelligence, when I was ambushed by a passage in the article that aroused my pique. That's one of the pitfalls of knowing too much about a topic a journalist is discussing; journalists often make mistakes that... |
|
| | | | | ||
| | | | |
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$. |
|
| | | | | ||
| | | | |
djalil.chafai.net
This post provides the solution to a tiny exercise of probability theory, answering the question asked by a student during the MAP-432 class yesterday. Let \( {(\Omega,\mathcal{F},\mathbb{P})} \) be a probability space equipped with a filtration \( {{(\mathcal{F}_n)}_{n\geq0}} \). Recall that a random variable \( {\tau} \) taking values in \( {\mathbb{N}=\{0,1,\ldots\}} \) is a stopping time when \( {\{\tau=n\}\in\mathcal{F}_n}... |
|
| | | |||
