Tony's Log

Again, it is a study note of 'Machine Learning in Action'. Here is a refined variation to Apriori principle - FP-Growth algorithmThe key data structure is Condition FP Tree - a Trie with each path a

"Machine Learning in Action" is a good book. I've learnt Apriori algorithm successfully. Here is a working Python3 code piece:# Load Datadef loadDataSet(path): return [[1, 3, 4],

Continued with last post.. now I'm using C++ meta-programming to solve this problem - all computation moved to compile time.But there are limitations for G++ to compile template like recursion depth

http://www.mathblog.dk/project-euler-46-odd-number-prime-square/Not a hard one to code, but it can be optimized using SSE2 instructions. The code below runs with g++ 4.8.1: g++ -g -c riddle.cpp

The first time when I read chapter 4 "Transforms", the Quaternion part confused me a lot.You may have already read this great article: http://betterexplained.com/articles/a-visual-intuitive-guide-to

My main reference is : http://mostlycode.wordpress.com/2010/01/03/shared-haskell-so-library-with-ghc-6-10-4-and-cabal/Step 1: Write your Haskell code

Almost every Haskell beginner reads the following 2 books:

#include "boost/preprocessor/seq/size.hpp" #include "boost/preprocessor/seq/elem.hpp" #include "boost/preprocessor/seq/push_back.hpp" #include "boost/preprocessor/stringize.hpp" #include "boost/pr

0. Make sure you have built\installed gcov\lcov\genhtml on your linux machine

Remember the mathematical representation of Turing machine? Here comes a programming language that looks just like a 'raw' simulation to that.http://www.muppetlabs.com/~breadbox/bf/http://www.he

I got my current copy of concrete maths about four years ago in Shanghai. And now I finally possess the courage and determination to read it. What surprised me is that this book is so accessible and f

OK finally I have read it over (at Baltimore MD), though pretty roughly. In recent months, my majority brain cycles were on this book. And compared with other CS books I read before, first, it is on T

I encounter a very interesting C++ certification course\program free online: http://www.cppgm.org/about.htmlIt is called C++ 'GRANDMASTER' certification. Sounds pretty ambitious and challenging does

Finally Turing machine is introduced. With NFA\PDA in mind, readers should be able to understand Turing machine without too much effort. Again, Prof. Michael Sisper deserves a title of Teaching Guru.

Chapter 2 is a generalized chapter 1, just like (G)NFA to DFA. Combining GNFA|Regular lang., readers should be able to understand PDA|Ctx-Free grammar without too much effort.. Yes, this is what you

"Introduction to the Theory of Computation" (by Michael Sipser) is a perfect book for TCS beginners. It is superbly accessible and friendly to TCS rookies, which never makes your bored during your r

http://book.douban.com/subject/10750155/I saw this book in bookstore first, instead of Amazon\China-Pub that is the usual way I got to know new books. I was amazed by this book and became happie

The essence of compiler is in back-end, precisely, it is optimization. And Register Allocation is one very important aspect of compiler optimization. This article contains a simple review on existin

Reference: http://blog.csdn.net/wooin手把手教你把Vim改装成一个IDE编程环境(图文)我的vimrc

http://plato.stanford.edu/entries/qt-quantcomp/