jleahy

32 ms·

331.
by jleahy 12y ago
That changes things, it's a shame the website doesn't explicitly say that it's faster than gzip to decompress, it just says it's faster than LZMA, which isn't saying much. Much better than lz4hc (7 ns/byte, but
332.
by jleahy 12y ago
Given that LZMA is the algorithm with the highest compression ratio and lowest speed of all commonly used algorithms, this isn't particularly impressive. Why is it better than bzip2, or gzip? Both of these are 2-3x faster than LZMA (mu
333.
by jleahy 12y ago
Although they're still using Adobe Flash Player for the graph.
334.
by jleahy 12y ago
This should really be tagged as 1996, especially as since this was written the world of lock-free algorithms has moved forwards a lot. At the very least Fober et al suggested an alternative that performs a tad better in 2002 ( http:/&#
335.
Neurogrid: Mixed-Analog-Digital Neural Simulations(stanford.edu)
1 points by jleahy 12y ago|0 comments
336.
by jleahy 13y ago
People who receive CT scans have a higher rate of cancer. This seems like a logical fallacy. People who receive CT scans are more likely to get cancer. So CT scans must cause cancer. The alternate hypothesis are that people who are more lik
337.
by jleahy 13y ago
That's a good point, I guess with something like that you'll never know how close you are until you get there. Nonetheless, once we get there (and I see no reason why we shouldn't eventually - even if it's via and exact
338.
by jleahy 13y ago
Although it might be possible to modify the mass of a computer by a factor of 2 this is really not going to affect its score so much, given the presence of a logarithm. You're definitely not going to be able to adjust its mass by an or
339.
A Python component architecture(regebro.wordpress.com)
1 points by jleahy 13y ago|0 comments