Hacker News
- Simplifying "Intriguing properties of neural networks" https://iq.opengenus.org/intriguing-properties-neural-network/ 2 comments
- Audio Fingerprinting using the AudioContext API https://iq.opengenus.org/audio-fingerprinting/ 166 comments
- Face Aging using Conditional GANs with Keras implementation https://iq.opengenus.org/face-aging-cgan-keras/ 2 comments
- Basic GPU design concepts https://iq.opengenus.org/basic-graphics-processing-unit-gpu-design-concepts/ 25 comments
Lobsters
- List of C Compilers (As early as 1973 and with the latest one at 2017) https://iq.opengenus.org/list-of-c-compilers/ 9 comments c , compilers
- Machine Learning models can be fooled badly https://iq.opengenus.org/deep-neural-networks-are-easily-fooled/ 8 comments compsci
- Bloom Filter: Better than Hash Map for O(1) searching https://iq.opengenus.org/bloom-filter/ 31 comments programming
- Burkhard Keller Tree (BK Tree) to find similar strings https://iq.opengenus.org/burkhard-keller-tree/ 3 comments compsci
- MLIR (a Google Project) : Redefining the compiler infrastructure https://iq.opengenus.org/mlir-compiler-infrastructure/ 15 comments compsci
- It seems Face detection was done in 2001 as well https://iq.opengenus.org/face-detection-using-viola-jones-algorithm/ 14 comments compsci
- Rope: Data Structure used by text editors like Sublime to handle large strings https://iq.opengenus.org/rope-data-structure/ 9 comments compsci
- Clique decision problem is NP-complete but finding cliques of a given size is elegantly simple https://iq.opengenus.org/algorithm-to-find-cliques-of-a-given-size-k/ 5 comments compsci
- Internet is a strongly connected graph and we can find it in linear time using Kosaraju's algorithm https://iq.opengenus.org/kosarajus-algorithm-for-strongly-connected-components/ 8 comments compsci
- Algorithm to find cliques of a given size k in O(n^k) time complexity https://iq.opengenus.org/algorithm-to-find-cliques-of-a-given-size-k/ 3 comments compsci