_posted by Shriram Krishnamurthi_ [Edit on 2012-08-27, 12:31EDT: added code and pictures below. 2012-08-27, 13:10EDT: also incorporated some comments.] I wrote this on the Racket educators' mailing list, and Eli Barzilay suggested I post it here as well...
Meta Title: Math, Sports Data & IPTV: A Portugal Guide Meta Description: Explore how math-minded sports fans use IPTV in Portugal to watch live football, Champi
Read Wolfram's latest announcements, events, news and developer insights. In-depth highlights of Wolfram technologies used across industry, research, education.
A hash table is data structure that is used to search for exact matches to a search key. For searching, they work like this: Take a search key (example: the word “cat”) Hash the search …
A Bloom filter is a data structure that may report it contains an item that it does not (a false positive), but is guaranteed to report correctly if it contains the item (“no false negatives”). The opposite of a Bloom filter is a data structure that may report a false negative, but can never report a false positive…
The other day a programmer-friend sent an e-mail to me and three other women. It read:
The Complexity of Things Previously on this blog (quite a while ago), we’ve investigated some simple ideas of using randomness in artistic design (psychedelic art, and earlier randomized css …
I usually avoid current events, but recent skirmishes in the math world prompted me to chime in. To recap, there've been heated discussions about math…
A group of Finnish mathematics researchers, teachers and students write an upper secondary mathematics textbook in a booksprint. The event s...
You may feel like you've seen this before. If you have, skip to the end where I talk about a formula, and discuss the relevance to parameters in computer hashing algorithms. In particular, I'm going to talk about how large hash spaces should be to avoid collisions with a given level of probability. If there are just…
Bayes’ Theorem for the curious and bewildered; an excruciatingly gentle introduction.
