33 min listen
[MINI] k-d trees
FromData Skeptic
ratings:
Length:
14 minutes
Released:
Feb 5, 2016
Format:
Podcast episode
Description
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 prerequisite.
Released:
Feb 5, 2016
Format:
Podcast episode
Titles in the series (100)
Streetlight Outage and Crime Rate Analysis with Zach Seeskin: This episode features a discussion with statistics PhD student Zach Seeskin about a project he was involved in as part of the Eric and Wendy Schmidt Data Science for Social Good Summer Fellowship. The project involved exploring the... by Data Skeptic