Outer Web | Explore

Explore >> Select a destination

You are here		lucatrevisan.wordpress.com The spectrum of the infinite tree \| in theory
\|	\|	nickhar.wordpress.com Lecture 15: Low-rank approximation of matrices \| UBC CPSC 536N	3.4 parsecs away Travel
\|	\|	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...	3.4 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	3.3 parsecs away Travel
\|	\|	The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite...	3.3 parsecs away Travel
\|	\|	gilkalai.wordpress.com The Solution of Feige's conjecture by Guruswami, Kothari and Manohar (Re-blogged from "In Theory") \| Combinatorics and more	3.8 parsecs away Travel
\|	\|	https://lucatrevisan.wordpress.com/2024/04/27/feiges-conjecture-and-the-magic-of-kikuchi-graphs/#comments?page_id=4685 Luca Trevisan I'm reblogging here a beautiful post by Luca Trevisan from his blog "In Theory". The original post appeared a year ago in April 2024. A few weeks after this post was published, Luca sadly passed away at the age of 52. In this post, Luca masterfully describes the resolution of Feige's conjecture...	3.8 parsecs away Travel
\|	\|	rpihlgrenblog.wordpress.com Happy New Year! \| r. pihlgren's blog	10.8 parsecs away Travel
\|		What's going to happen this year? Let's see what happens...	10.8 parsecs away Travel