Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
bartwronski.com
|
|
| | | | | Singular components of a light transport matrix - for an explanation of what's going on - keep on reading! In this post Ill describe a small hike into the landscape of using linear algebra methods for analyzing seemingly non-algebraic problems, like light transport. This is very common in some domains of computer science / electrical | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | |
| | | | |
liorsinai.github.io
|
|
| | | | | How to calculate the statistical distance between two 2D distributions of points. But first a lesson in bad statistics, the pitfalls of visual solutions and ... | |
| | | | |
blog.scottlogic.com
|
|
| | | Recently I've been learning about Neural Networks and how they work. In this blog post I write a simple introduction in to some of the core concepts of a basic layered neural network. | ||
