Bloom Filters
The original motivation for the creation of Bloom filters is efficient set membership, using a probabilistic approach to significantly reduce the time and space required to reject items that are not members in a certain set.
The latest blog posts to take off on Hacker News. 2,851 posts.
The original motivation for the creation of Bloom filters is efficient set membership, using a probabilistic approach to significantly reduce the time and space required to reject items that are not members in a certain set.
Made in Notion, the connected workspace where AI agents and teams organize docs, projects and knowledge together.
With the concern that “Moore’s Law is dead,” new interest has grown for unconventional forms of computing. This includes:
In numerous applications of machine learning, Hessians and Jacobians exhibit sparsity, a property that can be leveraged to vastly accelerate their computation. While the usage of automatic differentiation in machine learning is ubiquitous, automatic sparse differentiation (ASD) remains largely unknown. This post…
We have solved a traveling salesman problem (TSP) to walk to 81,998 bars in South Korea. The problem was created using the Open Source Routing Machine (OSRM) to build a table of the 3,361,795,003 point-to-point travel times, one for each pair of bar locations. Our computation produced a tour together with a proof that…
This is a brief continuation of a previous post ( Repo ), which introduced such visualization for collatz sequences based on Langton’s Ant .
High-degree polynomial features aren’t inherently unstable: the power basis and unscaled inputs are. This post shows how regularization and Bernstein polynomials make polynomial regression behave.
As programming languages researchers, we’re entitled to a certain level of mathematical rigor behind the languages we write and analyze. Programming languages have semantics , which are definitions of what statements in the language mean. We can use those semantics to do all sorts of useful things, like error…
The integral of sec(x) is well known to any beginners calculus student. Yet this integral was once a major outstanding maths problem. It was first introduced...
This is Jessica. In my Prediction for Decision-making class last quarter we talked about human predictions and decisions relative to algorithmic ones. This led to a discussion about why it’s often hard to demonstrate the value of human knowledge once you have a decent statistical model.
Po-Shen Loh explains why Euler's number e is natural using only precalculus: one exponential curve has tangent slope 1 at the y-axis, which leads to the compound interest limit.
It's a justifiable copout, but it's still a copout.
Through a couple of different avenues I wandered, yet again, down a rabbit hole leading to the topic of this post. The first avenue was through my main focus on a particular machine learning topic th
People say many things about entropy: entropy increases with time, entropy is disorder, entropy increases with energy, entropy determines the arrow of time, etc.. But I have no idea what entropy is, and from what I find, neither do most other people. This is the introduction I wish I had when first told about entropy…
In the previous chapter, we assumed that we can uniformly randomly sample our domain. However, it’s not obvious how to actually do so—in fact, how can a deterministic computer even generate random numbers? 1
My journey implementing a new dithering algorithm in the Racket programming language.
Look at this orange: Now look at this orange: It’s the same orange. But, look how much more orange it looks with the red mesh on top of it: If you buy bags of oranges (at least at many places in the US), they frequently come in this red mesh bag. This bag makes the oranges look more orange. Oranger. Here’s what that…
The Ivory Tower is a blog about software engineering and development philosophy by Anders Sundman.
A new algebraic method for hardware-accelerated bilinear interpolation on convex quadrilaterals is presented, using the Barycentric coordinate feature of modern GPUs.
Someone online was solving Advent of Code problems, and had a question about last years’ day 3 . They had a working solution using regular expressions (regexes) on String values, but they wanted to use ByteString values instead for performance reasons. They were surprised, however, that there seems to be a lack of…
I have a lot in the works for the this month's Logic for Programmers release. Among other things, I'm completely rewriting the chapter on Logic Programming...
Chris Grossack's math blog and professional website.
I remember thinking at school when will I ever in my “real life” use maths. Well much to my utter surprise I’ve come to the stark realisation that there is a link between mathematics and crochet. …
Dori | Art Director, Designer, Artist
The challenge The authoring platform of choice in many math-heavy disciplines is LaTeX. It produces typeset documents of excellent quality and handles formulas and mathematical diagrams extremely w…
I’ve just uploaded to the arXiv the paper “Decomposing a factorial into large factors”. This paper studies the quantity $latex {t(N)}&fg=000000$, defined as the largest quanti…
The conventional wisdom is that hashing more entropy sources can't hurt: if H is any modern cryptographic hash function then H(x,y,z) is at least as good a random number as H(x,y), no matter how awful z is. So we pile one source on top of another, hashing them all together and hoping that at least one of them is good.
[Updated on 2020-09-03: Updated the algorithm of SARSA and Q-learning so that the difference is more pronounced. [Updated on 2021-09-19: Thanks to 爱吃猫的鱼, we have this post in Chinese].