usamec

6 ms·

1.
by usamec 12y ago
This can be also helpful: http://www.similarweb.com/website/savedeo.com
2.
by usamec 12y ago
You are using worst kinds of ads on the internet. And the only thing which my chrome blocks is actually the link to video.
3.
How to quickly find out what influences risk of prostate cancer?(blog.scicurve.com)
2 points by usamec 12y ago|0 comments
4.
MLCube – data science made easy(mlcube.com)
3 points by usamec 12y ago|0 comments
5.
by usamec 12y ago
I would never put KMP and Coppersmith-Winograd into same place in terms of practicality. KMP gives you very good and fast results on some data (especially data with repeated sequences). Coppersmith-Winograd (and even Strassen) will never be
6.
by usamec 12y ago
There is no reason to implement fibonacci heap for Dijkstra. Either you have relatively small data (up to 10 mil. nodes and edges) and normal heap is a way faster or you have bigger data and you should start thinking about things like A* wh
7.
by usamec 13y ago
"2) it demystifies machine learning -- you have to write your ML from scratch, without the help of all those wonderful Python libs, and I think this exercise shows you that it's not so mysterious after all." - you can demysti
8.
by usamec 13y ago
What are advantages of this thing against apache or nginx? Is it faster? Handles more concurent request? Or does it exists just for the sake of writing server in PHP?
9.
by usamec 13y ago
I think that setting up apache+php is much harder than copy&pasting few basic lines of flask code a running simple python program.
10.
by usamec 13y ago
High quality PHP does not exists, since PHP is ultra low quality language: http://me.veekun.com/blog/2012/04/09/php-a-fractal-of-bad-de...
11.
by usamec 13y ago
Ehm. But sometimes stupid linux kernel prefers moving something usefull to swap and caching some shit instead of keeping stuff in ram and not doing caching. So linux sometimes eats your RAM (but in different way).
12.
by usamec 13y ago
It is much better to speed to aligment using heuristics (e.g. use hashing for find matching kmers and do dynamic programming only on small portion of data) than by using faster hardware. Look here: http://bowtie-bio.sourceforge.
13.
by usamec 13y ago
Evolved shit is still shit. Half of issues mentioned here ( http://me.veekun.com/blog/2012/04/09/php-a-fractal-of-bad-de... ) are still not solved.
14.
by usamec 13y ago
Ok, PHP got package manager and MVC frameworks, but half of problems mentioned here http://me.veekun.com/blog/2012/04/09/php-a-fractal-of-bad-de... are still not fixed. It's shitty language and pack
15.
by usamec 13y ago
Totally bad article. It encourages bad practices like checking validity on the same set as model was trained on. You should do some cross-validation or at least split data into two parts, train model on the first part and test it on the sec
16.
by usamec 13y ago
Well, he get proving that his problem is NP-hard right (because the proof is really easy). But his algorithm for solving his problem is really messy and hard to follow.
17.
by usamec 13y ago
P=NP doesn't imply that there is fast algorithm for every problem in NP. It only means, that there is polynomial time algorithm for everything in NP (e.g. n^100 is polynomial). For example there can be O(n^100) algorithm for solving 3-SAT,
18.
by usamec 13y ago
Nope, there are constrains on how the path might look or not. The constrains have form: Is path enters vertex v, then it might only use edges {...}.
19.
by usamec 13y ago
O(n^10) algorithm is in P, but does not solve large inputs in reasonable time.
20.
by usamec 13y ago
I disagree. They just found the most simple way how to delete that article.
21.
by usamec 14y ago
Trying to build fast platform on top of a superslow language is a joke.
22.
by usamec 14y ago
this is a joke, right?
23.
by usamec 14y ago
there are no restrictions so far :)