Thursday, October 25, 2018

how to reinvent the bicycle

›
I've been recently conducting some job interviews, and met a spate of junior engineer candidates with a similar issue: they could quickl...
Thursday, October 11, 2018

simplicity is in the eye of beholder

›
I've been recently discussing a design with someone. We both wanted the design to be simple but disagreed about the details. Eventually ...
Thursday, September 6, 2018

COW filesystems

›
I've recently learned the term "Copy-On-Write filesystem". I guess I've been living under a rock. Not that it's a new ...
Sunday, July 1, 2018

graph equivalence 6: optimizations

›
<<Prev Next>> I've already mentioned some possible optimizations but let's have another look at them. The first opt...
Saturday, June 16, 2018

graph equivalence 5: resolving the hash collisions

›
<<Prev Next>> Here is the version with the hash collision resolution: 1. While there are any nodes with unassigned ID:   1...
Monday, June 11, 2018

graph equivalence 4: why it works

›
<<Prev Next>> The general graphs are worse, the "redundant links" in them that aren't in the tree present a maj...

graph equivalence 3: why it works, simplified

›
<<Prev Next>> To understand why the algorithm in part 1 works (um, no, not quite ), let's take a step back and think, wha...
Sunday, June 10, 2018

graph equivalence part 2: comparing the graph signatures

›
<<Prev Next>> In the part 1 I've told how to build the signatures but haven't told how to compare them. So, a signa...
Saturday, June 9, 2018

graph equivalence 1: the overall algorithm

›
Next>> I want to talk about some interesting graph processing I've done recently. As a part of a bigger problem, I needed to col...
1 comment:
Tuesday, May 29, 2018

SQL "With" statement

›
I've recently learned about the WITH statement in SQL that had apparently been there since the 1999 standard. It pretty much allows you ...
Monday, March 19, 2018

Comments and names

›
I've read an opinion that if the names of the methods are self-explanatory, the comments describing these methods are not needed. Well...
Sunday, December 17, 2017

waiting for a condition: another way

›
I've recently encountered another way of doing synchronization without condition variables in the Abseil library : their mutex has the m...
Saturday, September 30, 2017

removing the duplication in Bayesian & AdaBoost

›
I've been thinking some more on how to remove the duplication between the Bayesian events/AdaBoost partial hypotheses. Here are some no...

AdaBoost conjunctions & XOR

›
I've been thinking recently about the better ways to extract the commonality from two Bayesian events (hope to find time to write about ...
Monday, September 25, 2017

Boosting book reference

›
I've accidentally found the Freund and Schapire's book on AdaBoost online: https://mitpress.mit.edu/sites/default/files/titles/con...
Tuesday, September 19, 2017

Reversible computing

›
I've read an article in the IEEE magazine about he reversible computing: https://spectrum.ieee.org/computing/hardware/the-future-of-comp...
Wednesday, September 6, 2017

AdaBoost 10: a better metric?

›
Here is one more consequence I've noticed from the application of AdaBoost approach to the Bayesian one: it can be applied the other way...
Tuesday, August 1, 2017

Bayes 27 & AdaBoost: another problem with partial confidence

›
The solution from the previous installment can handle the partial confidence but it has its own issue. To demonstrate it, let's look at ...
Monday, July 10, 2017

Bayes 26 & AdaBoost: more on the partial confidence

›
I think I've found at least a partial solution to the problem of partial confidence that avoids going exponential. It grows right out...
Sunday, June 4, 2017

Neuron in the Bayesian terms, part 3

›
I want to elaborate on why the second trick is so important. Basically, because in general the necessary condition of the chances changing o...