Posts

Filtered-Space Saving (FSS) is a data structure and algorithm combination useful for accurately estimating the top k most frequent values appearing in a stream while using a constant, minimal memory footprint.

CONTINUE READING

Gödel’s incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics.

CONTINUE READING

The optimal solution for weighted random should be the Alias Method. It requires $O(n)$ time to initialize, $O(1)$ time to make a selection, and $O(n)$ memory.

CONTINUE READING

A Python implementation for illustrating the behavior of logistic map.

CONTINUE READING

Create a beautifully simple website or blog in under 10 minutes.

CONTINUE READING

Linux Threads vs Light Weight Processes.

CONTINUE READING