Skip to content

csen2025.org

csen2025.org

Add Listing
Graph of various sorting algorithms compared.
  • Dr. Ingrid Falk-Weller
  • May 21, 2026
  • (0)
  • Algorithms

Quicksort Is Fastest Until the Input Is Already Sorted

I spent three years in academia watching brilliant PhD students derive complex proofs for optimal sorting, only to watch them build production systems that choked because they ignored cache locality. It’s infuriating. We treat these comparisons like they are settled…

Read More
k nearest neighbours prediction error visualization
  • Dr. Ingrid Falk-Weller
  • May 20, 2026
  • (0)
  • Machine Learning

No Training at All, and a Very Expensive Prediction

I spent most of my PhD watching brilliant researchers build incredibly complex, multi-layered neural networks to solve problems that could have been handled by a simple distance metric. There is this pervasive, almost academic vanity that suggests if an algorithm…

Read More
Visualizing kernel methods intuition in high-dimensional space.
  • Dr. Ingrid Falk-Weller
  • May 16, 2026
  • (0)
  • Machine Learning

Comparing Points in a Space You Never Actually Build

I spent three months in a PhD lab trying to wrap my head around the “mathematical elegance” of Hilbert spaces, only to realize that most textbooks treat kernel methods intuition like a sacred, untouchable ritual. They throw high-dimensional geometry at…

Read More
Refactoring safely ensures behavior remains unchanged.
  • Dr. Ingrid Falk-Weller
  • May 14, 2026
  • (0)
  • Software Engineering

Refactoring Means Behaviour Does Not Change, or It Is Not Refactoring

I remember sitting in a windowless server room three years ago, watching a junior engineer attempt to “clean up” a critical path in our distributed consensus module. He had followed a textbook pattern to the letter, yet within twenty minutes,…

Read More
Ethics in computing research: technical feasibility.
  • Dr. Ingrid Falk-Weller
  • May 14, 2026
  • (0)
  • Research Practice

Technical Feasibility Is Not Ethical Permission

I remember sitting in a windowless conference room during my final year of my PhD, listening to a senior researcher drone on about how “ethical frameworks” would naturally emerge from the elegance of our new distributed consensus algorithm. It was…

Read More
Understanding write amplification on SSDs.
  • Dr. Ingrid Falk-Weller
  • May 12, 2026
  • (0)
  • Systems

Writing One Byte Can Rewrite a Megabyte

I remember sitting in a windowless server room during my first industry stint, staring at a telemetry dashboard that made absolutely no sense. We were pushing what we thought was a modest workload, yet the drive endurance metrics were cratering…

Read More
Binary search beyond sorted arrays concept.
  • Dr. Ingrid Falk-Weller
  • May 12, 2026
  • (0)
  • Algorithms

Binary Search Works on Any Question With a Yes No Boundary

I spent three years in academia watching brilliant researchers build incredibly complex, distributed indexing structures just to avoid a problem that could have been solved with a simple decision tree. It’s a recurring frustration of mine: we see these massive,…

Read More
SSD behaviour versus HDD random read performance.
  • Dr. Ingrid Falk-Weller
  • May 10, 2026
  • (0)
  • Systems

Random Reads Stopped Being Expensive

I spent most of my graduate years listening to the rhythmic, mechanical click of hard drives—a sound that felt reliable until I realized it was actually the sound of physical limitations fighting against my code. Most people approach the debate…

Read More
Maximizing margins using support vector machines.
  • Dr. Ingrid Falk-Weller
  • May 7, 2026
  • (0)
  • Machine Learning

Finding the Widest Possible Gap Between Two Classes

I spent three years in academia watching people treat support vector machines like some sort of mystical, impenetrable black box that required a divine revelation to implement. I’ve sat through seminars where presenters used dense, intimidating notation to mask the…

Read More
Union find and path compression algorithm diagram.
  • Dr. Ingrid Falk-Weller
  • May 7, 2026
  • (0)
  • Algorithms

Nearly Constant Time by Rewriting History

I spent three weeks in my late twenties debugging a distributed consensus module, only to realize the bottleneck wasn’t the network latency or the consensus protocol itself, but a poorly implemented Disjoint Set Union. Most textbooks present union find and…

Read More
  • 1
  • ...
  • 6
  • 7
  • 8
  • 9
  • 10
  • ...
  • 17

Recent Posts

  • Distance Costs More in Coordination Than in Time Zones
  • The Cross Product Answers Which Side of a Line You Are on
  • Without a Nonlinearity the Whole Network Collapses to One Layer
  • Agree the Author List Before the Work, Not After
  • The Optimiser Tells You Exactly What It Is About to Do

Recent Comments

No comments to show.

Archives

  • August 2026
  • July 2026
  • June 2026
  • May 2026
  • April 2026
  • March 2026
  • February 2026
  • January 2026

Categories

  • Algorithms
  • Machine Learning
  • Research Practice
  • Software Engineering
  • Systems

2026© All right reserved by Radiustheme