Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		lucatrevisan.wordpress.com Online Optimization Post 2: Constructing Pseudorandom Sets \| in theory
\|	\|	grigory.github.io What's New in the Big Data Theory 2016 - The Big Data Theory	3.9 parsecs away Travel
\|	\|	Collection of interesting papers on algorithms for big data from 2016.	3.9 parsecs away Travel
\|	\|	nickhar.wordpress.com Lecture 25: Online Steiner Tree \| UBC CPSC 536N	3.3 parsecs away Travel
\|	\|	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...	3.3 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	3.5 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.5 parsecs away Travel
\|	\|	mycqstate.wordpress.com UCSD Spring school on Quantum Computation \| MyCQstate	20.4 parsecs away Travel
\|		A couple months from nowDorit Aharonov,David Gossetand myself will be giving a short 3.5-day "Spring School" that is meant to be an introduction to recent topics in quantum computing, directed at young researchers in theoretical computer science at large. Theschoolis organized by Shachar Lovett at the University of California in San Diego, from March 19th...	20.4 parsecs away Travel