You can also also view the full archives of micro-posts. Longer blog posts are available in the Articles section.
Advanced Matrix Multiplication Optimization on Modern Multi-Core Processors: Lot of micro-optimization like caching and kernel tricks.
Algorithms for Competitive Programming (via Nima Aghdaii’s post on Suffix Arrays).
/me is listening to “Tell Me Who You Are Today” by Beth Gibbons
On kerning vs. letterspacing: kerning is more specific: it refers to special cases where pairs of adjacent characters are pushed towards each other.
“Oh my god! They linked in more than 64k of floating point library to compute the sqrt of an integer that is always less than 128!? For gods sake, just use a for loop counting up to 12! Or if a for loop seems liek too much work, how about a 128 byte look up table?” — The IDEs we had 30 years ago… and we lost
A recommendation engine that looks at my browsing history, sees what blog posts or articles I spent the most time on, then searches the web every night for things I should be reading that I’m not. In the morning I should get a digest of links. I also want to be able to give feedback on which were good suggestions and which weren’t to improve the next day’s digest. — The 28 AI tools I wish existed
Back in the days, I used to use Prismatic, and I was very happy with its recommendation engine. Recommendation engines and collaborative filtering are everywhere since then. What’s next?
Why use a language with 0-based indexing for linear algebra other than putting an additional cognitive burden on the students learning the subject? This is a recipe for the nefarious off-by-one error. And these errors are sneaky. The code might run but produce incorrect results and it’s a nightmare for the students (or the poor TA helping them) to figure out why. — Is Fortran better than Python for teaching the basics of numerical linear algebra?