/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

 izbicki.me
HLearn cross-validates >400x faster than Weka
| | andrew222651.com
Uncertainty due to computational approximation in Bayesian inference ยท Andrew's Blog
7.5 parsecs away

Travel
| |
| | www.chriswarbo.net
Optimal Programming
7.4 parsecs away

Travel
| | [AI summary] An author explores methods to automate programming tasks, comparing theoretical approaches like Levin Search and Solomonoff Induction with practical heuristics such as Genetic Algorithms.
| | algorithmsoup.wordpress.com
The World's Simplest Interesting Algorithm - Algorithm Soup
9.0 parsecs away

Travel
| | 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...
| | blog.computationalcomplexity.org
Computational Complexity: Approximate Computing
25.2 parsecs away

Travel
| Hadi Esmaeilzadeh is the newest professor in the School of Computer Science at Georgia Tech. Hadi works in computer architecture and did s...