Jacob Kaplan-Moss

15 items tagged β€œalgorithms”

πŸ“Œ Predicting Pace Based on Previous Training Runs #
πŸ“Œ Complexification | Gallery of Computation #
πŸ“Œ Basho | Why Vector Clocks are Easy #
πŸ“Œ hatful of hollow - Visualising Sorting Algorithms

Really awesome, and I think I finally understand how heapsort works. Oh, and it comes with bonus Python+Cairo examples. #

πŸ“Œ An Exercise in Species Barcoding

Peter Norgig drops some science. #

πŸ“Œ Introduction to Information Retrieval

Looks like a must-read; Matt says that this is the best technical book he’s read in years. #

πŸ“Œ How Nate Silver Went From Forecasting Baseball Games to Forecasting Elections -- New York Magazine

FiveThirtyEight has firmly wedged its way into the small list of sites I read obsessively. #

πŸ“Œ Simple Top-Down Parsing inΒ Python

Fantastic article on building a top-down parser in just a few hundred lines of Python. Read this even if you don’t care about parsing: effbot really demonstrates many of the cool idiomatic tricks that makes Python such a pleasure to write and read. #

πŸ“Œ TrueCrypt explained

Cryptography makes my head hurt. #

πŸ“Œ Xapian: Theoretical Background

Some good notes on how relevancy algorithms actually work. Must read through this in more detail. #

πŸ“Œ Statistical Data Mining Tutorials

Um, wow. #

πŸ“Œ Structure and Interpretation of Computer Programs, Video Lectures

Video lectures to accompany SCIP. Awesome. #

πŸ“Œ Artificial Intelligence: A Modern Approach #
πŸ“Œ The Very Blind Date Voting System

A scoring system loosely based on Condorcet, but more stable. Now I just need an excuse to use this... #

πŸ“Œ Inefficient sort algorithms

This paper is the condensation of a discussion of inefficient sorts in the talk.origins newsgroup. The main focus was on a sort suggested by Richard Harter. Although the topic (and much of the discussion) was apparently frivolous it raised real mathematic #