exg

5 ms·

1. 1.▲
   by exg 13y ago

   Correct me if I am wrong, but I do not think that DBPedia includes the full Wikipedia articles (only extended abstracts). So I believe that json dumps of DBPedia and Wikipedia dumps produced using this tool are two different things.
2. 2.▲
   by exg 13y ago

   Sparse fast Fourier transform is even more "magical" than fast Fourier transform (FFT). If you assume that the discrete Fourier transform (DFT) has only k non zero coefficients, then, there exists an algorithm to compute it in O(k
3. 3.▲
   The Vine Nerds(wired.com)

   8 points by exg 14y ago|2 comments
4. 4.▲
   People's list, by Pitchfork(pitchfork.com)

   1 points by exg 14y ago|0 comments
5. 5.▲
   by exg 14y ago

   The Elements of Statistical Learning, by T. Hastie, R. Tibshirani and J. Friedman [1] is also a very good one. Plus, the book is freely available on the authors' website. [1] http://www-stat.stanford.edu/~tibs/ElemStatLearn/
6. 6.▲
   by exg 14y ago

   From what I have understood by watching his TED talk, the algorithm he designed seems very similar to papers published in the NLP field recently [1] [2] [3]. I find it quite elegant, and I agree that the kid is really smart. The idea behind