K D Trees

Data Skeptic

This episode reviews the concept of k-d trees: an efficient data structure for holding multidimensional objects. Kyle gives Linhda a dictionary and asks her to look up words as a way of introducing the concept of binary search. We actually spend most of the episode talking about binary search before getting into k-d trees, but this is a necessary prerequis

Next Episodes

Data Skeptic

Auditing Algorithms @ Data Skeptic

📆 2016-01-29 01:00


Data Skeptic

Bonferroni Correction @ Data Skeptic

📆 2016-01-22 01:00


Data Skeptic

Detecting Pseudo-profound BS @ Data Skeptic

📆 2016-01-15 01:00


Data Skeptic

Gradient Descent @ Data Skeptic

📆 2016-01-08 01:00


Data Skeptic

Kill The Word Cloud @ Data Skeptic

📆 2016-01-01 01:00