Explore >> Select a destination
|
You are here 
|
dominiczypen.wordpress.com | ||
| | | | |
cuoichutdi.wordpress.com
|
|
| | | | | Liverpool v?a vô ??ch Premier League, ?i?u này t?o nên m?t th?ng kê thú v?: s? cúp vô ??ch c?a các ??i bóng t?o thành m?t dãy s? Fibonacci. ?i?u này là ng?u nhiên hay có m?t cách lí gi?i toán h?c ?n sau nó? Tôi biên bài báo ng?n v? dãy Fibonacci c?ng nh?... | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... | |
| | | | |
extremal010101.wordpress.com
|
|
| | | | | With Alexandros Eskenazis we posted a paper on arxiv "Learning low-degree functions from a logarithmic number of random queries" exponentially improving randomized query complexity for low degree functions. Perhaps a very basic question one asks in learning theory is as follows: there is an unknown function $latex f : \{-1,1\}^{n} \to \mathbb{R}$, and we are... | |
| | | | |
dsyme.home.blog
|
|
| | | This is an archive of https://blogs.msdn.com/dsyme, my old blog | ||
