121–130 of 507 posts
Oh, man. So many answers. The blockchain of bitcoin is pretty gorgeous, if that counts. AES is beautiful as well. And I love Huffman encoding. hm, what else. Bloom filters are awesome. I suspect FFT is beautiful, too, but it surpassed my ability to understand.
I personally think that Speck is pretty cool because of its extreme simplicity, but I can't see anything special about AES.
Binary search. Very simple, incredibly powerful; can search on data or math function. It's the basis for other CS concepts. JS implementation: https://gist.github.com/netgusto/90c8e0e7019a832cbf95eac58e1...
Isn't this bit: const mid = Math.floor((right + left) / 2); susceptible to overflow? EDIT: Hm, perhaps not (in JS). Number.MAX_SAFE_INTEGER is much greater than I expected.
Gaussian integration. You might have heard of "2nd order" or "4th order methods to calculate an integral. This means that the error drops off with the number of sampling points like N^-2 or N^-4, respectively. But Gaussian quadrature has spectral accuracy, which transcends this measure. Error goes down like an exponential of N. Another neat feature is polynomials of degree 2N-1 or less are integrated exactly with thi…
For example with f(x) = sqrt(1 + sin(x)) and you approximate integral f(x) dx from -1 to 1 with n Gauss points, then the the convergence is geometric:
n | approx
1 | 2.0-------------
2 | 1.9172----------
3 | 1.917703--------
4 | 1.917702153-----
5 | 1.917702154417--
6 | 1.91770215441681
n | approx
1 | 0.0-----------
10 | 1.007---------
100 | 1.00008-------
1000 | 1.0000008-----Binary search. Very simple, incredibly powerful; can search on data or math function. It's the basis for other CS concepts. JS implementation: https://gist.github.com/netgusto/90c8e0e7019a832cbf95eac58e1...
Isn't this bit: const mid = Math.floor((right + left) / 2); susceptible to overflow? EDIT: Hm, perhaps not (in JS). Number.MAX_SAFE_INTEGER is much greater than I expected.
https://ai.googleblog.com/2006/06/extra-extra-read-all-about...
Earlier quoted context omitted.
I love the idea of how essentially we have never met and we're shouting across a crowded room but no one else can understand our conversation.
Link?
With some clever tricks you can use it to "recover" a surd from a decimal
ie 1.4142135624 -> sqrt(2)
Gradient descent is quite amazing in its power and simplicity. If we can figure out a good loss function and a model architecture with enough parameters, calculus can basically take care of the rest.
I really like Viterbi. It has applications all across computer vision and filtering and it takes full advantage of the magic of dynamic programming.
Amusingly, despite having done a ton of Computer Vision (I worked for an image recognition company for 4 years) I never used it for that purpose. The main practical use case I had was related to the use of Trellis modulation [2] for band-limited communication channels.
[1] https://blog.separateconcerns.com/2013-03-03-viterbi-algorit...