Viewing profile — usamec

This can be also helpful: http://www.similarweb.com/website/savedeo.com

You are using worst kinds of ads on the internet. And the only thing which my chrome blocks is actually the link to video.

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 sequen…

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 bigge…

"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 no…

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?

I think that setting up apache+php is much harder than copy&pasting few basic lines of flask code a running simple python program.

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...

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…

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 har…

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.

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…

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…

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.

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…

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 {...}.

O(n^10) algorithm is in P, but does not solve large inputs in reasonable time.

I disagree. They just found the most simple way how to delete that article.

Trying to build fast platform on top of a superslow language is a joke.

this is a joke, right?

there are no restrictions so far :)