Computer

K-d Trees – Computerphile

One of the cleanest ways to cut down a search space when working out point proximity! Mike Pound explains K-Dimension Trees.

EXTRA BITS: https://youtu.be/uP20LhbHFBo

https://www.facebook.com/computerphile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: https://bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com

Products You May Like

Articles You May Like

Tilting an Icy Floor Until You Fall Over: WinterLab
Explore The Solar System! — DONG
The Story of Spotify
Atari 2600 VCS & Adventure – Computerphile
10 AMAZING CREATURES Created by SCIENCE!

Leave a Reply

Your email address will not be published.