/explore
|
You are here 
|
qbnets.wordpress.com | ||
| | | | |
weisser-zwerg.dev
A series about Monte Carlo methods and generating samples from probability distributions. |
|
| | | | | ||
| | | | |
willieneis.github.io
|
|
| | | | | ||
| | | | |
rjlipton.com
Can the permanent of stable negative matrices be approximated? Eric Vigoda is one of the top experts in the world in the area of Markov Chain Monte Carlo methods. He shared the prestigious Fulkerson Prize with Mark Jerrum and Alistair Sinclair for their brilliant work (JSV) on approximations to the permanent. Today I would like... |
|
| | | | | ||
| | | | |
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... |
|
| | | |||
