Explore >> Select a destination
|
You are here 
|
jiggerwit.wordpress.com | ||
| | | | |
corbettmaths.com
|
|
| | | | | The Ultimate GCSE Foundation Maths Revision Video and Booklet - Edexcel AQA OCR - Corbettmaths | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
micromath.wordpress.com
|
|
| | | | | Continuing the theme of alternative approaches to teaching calculus, I take the liberty of posting a letter sent by Donald Knuth to to the Notices of the American Mathematical Society in March, 1998 (TeX file). Professor Anthony W. Knapp P O Box 333 East Setauket, NY 11733 Dear editor, I am pleased to see so... | |
| | | | |
blog.georgeshakan.com
|
|
| | | Principal Component Analysis (PCA) is a popular technique in machine learning for dimension reduction. It can be derived from Singular Value Decomposition (SVD) which we will discuss in this post. We will cover the math, an example in python, and finally some intuition. The Math SVD asserts that any $latex m \times d$ matrix $latex... | ||
