Explore >> Select a destination
|
You are here 
|
lucatrevisan.wordpress.com | ||
| | | | |
gowers.wordpress.com
|
|
| | | | | Here is a simple but important fact about bipartite graphs. Let $latex G$ be a bipartite graph with (finite) vertex sets $latex X$ and $latex Y$ and edge density $latex \alpha$ (meaning that the number of edges is $latex \alpha |X||Y|$). Now choose $latex (x_1,x_2)$ uniformly at random from $latex X^2$ and $latex (y_1,y_2)$ uniformly | |
| | | | |
fa.bianp.net
|
|
| | | | | There's a fascinating link between minimization of quadratic functions and polynomials. A link that goes deep and allows to phrase optimization problems in the language of polynomials and vice versa. Using this connection, we can tap into centuries of research in the theory of polynomials and shed new light on ... | |
| | | | |
francisbach.com
|
|
| | | | | ||
| | | | |
www.danieldjohnson.com
|
|
| | | Writeup for my first major machine learning project. | ||
