OPAW: Independent Component Analysis

Independent Component Analysis (ICA) fascinates me [DEMO]. It's a neat method for isolating signals from a signal mix, as long as multiple recordings of the signal mix from different perspectives are available. An application would be isolating speakers in a conference room with many people talking (over each other), while a set of different microphones … Continue reading OPAW: Independent Component Analysis

OPAW: Optimal Bounds for Open Addressing Without Reordering

This paper by Martin Farach-Colton, Andrew Krapivin and William Kuszmaul shook the computer science interwebs last year as it proposed a much faster implementation for hash maps. An important disclaimer: unless you are way more bewandered in data structures than me, you're forgiven to believe that this paper revolutionises mainstream hash map implementations like the … Continue reading OPAW: Optimal Bounds for Open Addressing Without Reordering

Solving the 8 Queens puzzle with bit operations

The 8 queens puzzle is a classic (and quite fun to solve) toy problem: place eight queens on a chess board in such a way that all queens could fully move without being obstructed by any other queen. While without practical applications, it illustrates a number of aspects of designing algorithms and implementing programmes: - … Continue reading Solving the 8 Queens puzzle with bit operations