MADNESS

Use USACO [3_2_butter] as an exampleSPFA is an improvement of the Bellman-Ford algorithm, check the corresponding wikipedia page1. worst case: same complexity as Bellman-Ford O(VE)average perf

In Google's C++ Style Guide, the location of const is described as follows.Some people favor the form int const *foo to const int* foo. They argue that this is more readable because it's more

http://book.douban.com/subject/10769749/第1章 好的推荐系统推荐：social recommendation; content-based filtering; collaborative filtering系统：评测推荐效果的实验方法：1. offline experiment; 2. user study; 3. on

excerpt from "programming collective intelligence"...A slightly more sophisticated way to determine the similarity between people’s inter-ests is to use a Pearson correlation coefficient. The

excerpt from the book >http://www.greenteapress.com/compmod/html/thinkcomplexity006.html#toc38Explanatory modelsFigure 5.2: The logical structure of an explanatory model.

user-based collaborative filteringitem-based collaborative filtering: The general technique is to precompute the most similar items for each item. Then, when you wish to make recommendations to a us

http://blog.flux7.com/blogs/benchmarks/littles-lawLittle’s Law- An insight on the relation between latency and throughputI’ve been doing a lot of analysis of latency and throughput rec