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 | |
| | | | |
thomvolker.github.io
|
|
| | | | | Many different ways of calculating OLS regression coefficients exist, but some ways are more efficient than others. In this post we discuss some of the most common ways of calculating OLS regression coefficients, and how they relate to each other. Throughout, I assume some knowledge of linear algebra (i.e., the ability to multiply matrices), but other than that, I tried to simplify everything as much as possible. | |
| | | | |
hadrienj.github.io
|
|
| | | | | I'd like to introduce a series of blog posts and their corresponding Python Notebooks gathering notes on the Deep Learning Book from Ian Goodfellow, Yoshua B... | |
| | | | |
andrea.corbellini.name
|
|
| | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | ||
