featured in #420
Beautiful Branchless Binary Search
- Malte Skarupke tl;dr: “I read a blog post that describes a binary search called “Shar’s algorithm”. I’d never heard of it and it’s impossible to google, but looking at the algorithm I couldn’t help but think “this is branchless.” And who knew that there could be a branchless binary search?” Malte describes the algorithms mechanics.featured in #410
featured in #404
Twitter's Recommendation Algorithm
tl;dr: Twitter recommendation algorithm distills roughly 500 million tweets posted daily down to a handful of top tweets that show up on your device’s, specifically for you. This blog is an introduction to how the algorithm works.featured in #403
ICER Image Compression Algorithm
tl;dr: “The code in this repository implements the NASA ICER image compression algorithm as a C library. Said compression algorithm is a progressive, wavelet-based image compression algorithm designed to be resistant to data loss, making it suitable for use as the image compression algorithm when encoding images to be transmitted over unreliable delivery channels, such as those in satellite radio communications.”featured in #400
Online Gradient Descent Written In SQL
- Max Halford tl;dr: Max implements a ML algorithm within a relational database, using SQL. Some databases allow doing inference with an already trained model. Training the model in the database would remove altogether the need for a separate inference / training service. Max attempts to do this with the Online Gradient Descent algorithm.featured in #398
A Charming Algorithm for Count-Distinct
- Justin Jaffray tl;dr: "The count-distinct problem is to estimate the number of distinct elements appearing in a stream. That is, given some enumeration of “objects,” which you can think of as any data type you like, we want to know approximately how many unique objects there are."featured in #385
Diagram Layout Engines: Minimizing Hierarchical Edge Crossings
- Júlio César Batista tl;dr: TALA is a new layout engine designed specifically for software architecture. At its core, it combines many different graph visualization algorithms to produce aesthetic diagrams. This article is a part of a series where we dive into the inner workings of TALA. Today's topic is on minimizing edge crossings in hierarchical layouts.featured in #385
Twintrees, Baxter Permutations, and Floorplans
- Donald Knuth tl;dr: Video of Donald Knuth's annual lecture covering "three fascinating concepts, which seem at first to be entirely unrelated to each other, are in fact in one-to-one correspondence, via three beautiful algorithms."featured in #377
Challenging Algorithms And Data Structures Every Programmer Should Try
- Austin Henley tl;dr: "Not only have they come up during job interviews, but learning them changed how I think about problems." Austin's explains the following algorithms and data structures: (1) Topological sort. (2) Recursive descent parsing. (3) Myers string difference. (4) Bloom filter. (5) Piece table. (6) Splay tree.featured in #376