abetusk

106 ms·

1171.
by abetusk 11y ago
At that scale, we're talking about companies becoming nations.
1172.
by abetusk 11y ago
Chapter 1 [1] of Chee Yap's "Fundamental Problems of Algorithmic Algebra" [2] gives integer multiplication at O(n lg(n) lg(lg(n))). To prove that bound a "discrete Fourier transform" is used using modular arithmeti
1173.
by abetusk 11y ago
This is fantastic, good job! Any chance on making the source and design files available, maybe even through a libre license?
1174.
by abetusk 11y ago
$ nasm -f elf hello.asm $ ld -o hello hello.o ld: i386 architecture of input file `hello.o' is incompatible with i386:x86-64 output $ nasm -f elf64 hello.asm $ ld -o hello hello.o $ ./hello hello, friend
1175.
by abetusk 11y ago
For this use case, AGPLv3 is likely no more restrictive than the GPL.
1176.
by abetusk 11y ago
Why not?
1177.
by abetusk 11y ago
Are you sure about that? What happens when you get to a million cohort that you want to analyze?
1178.
by abetusk 11y ago
There's currently a post that has '-19' votes (as of this writing) that appears at the bottom. Since there are only up votes, I assume this is a bug. That's really too bad because it looks like that chart item would be
1179.
by abetusk 11y ago
In the case of the SaaS business models, is the first step even needed? I'm still trying to not be blinded by my idealism but is there really any value in making source proprietary if it's a SaaS business? Would GitHub's po
1180.
by abetusk 11y ago
Does anyone know why there isn't an entry for this organization in charitywatch.org?
1181.
by abetusk 11y ago
As far as I know there is still no easy facility to dynamically load libraries at runtime (like the analogous 'dlopen' in C). There are shared libraries and they can be linked at compile time so it's a step in the right dire
1182.
by abetusk 12y ago
At the risk of stating the obvious, even if this were true and we were actually really far away from AI or good computer vision classification, Moore's law should take effect. For every order of magnitude of difficulty it is, by whate
1183.
by abetusk 12y ago
Linear programming is not NP-hard, worst case or no. The interior point method [1] solves it in polynomial time. [1] http://en.wikipedia.org/wiki/Interior_point_method
1184.
by abetusk 12y ago
As far as I know, Quicksort cannot be implemented to be stable without an auxiliary array. So implementing Quicksort to be stable destroys the in-place feature. If you want something in-place and stable, you'll have to use something l
1185.
by abetusk 12y ago
Under the section "The Internet Theory", there is a graph labelled "Sexual Activity of High School Students". The graph shows the percentage teens who have ever been or are currently sexual active and it has stayed near