This article computes the probability of an observation being output by a given Hidden Markov Model. The brute force method is discussed, followed by a dynamic programming optimization. Derivations and diagrams are sketched out and time complexity is analyzed.
Continue readingCache Organization and Address Mapping
A clear understanding of various Cache organization concepts and the math behind it. Different address mapping schemes are discussed with descriptive images and detailed examples.
Continue readingConverting a Regular Expression to an equivalent NFA
A step-by-step approach to convert a regular expression to an equivalent NFA. Basic 6 cases are explained followed by a complex expression example.
Continue readingd-Separation through examples
This article presents a procedure to check whether two nodes in a Bayesian Network are conditionally independent from each other using the idea of active triples within the path connecting the nodes.
Continue readingVisualizing Hidden Markov Models
In this article, the notations behind expressing an Hidden Markov Model are explored through formal definitions, state diagrams and examples.
Continue readingConstructing the Cross-Product of 2 DFAs
A step-by-step visual approach to construct the Cross-Product of two DFAs to create the union and intersection of two languages.
Continue readingWrite and No-Write Allocate
An intuitive explanation of Write Allocate. All combinations of Write Back and Write Through schemes with Write and No-Write Allocate are discussed.
Continue readingCache Optimization – Critical Word First and Early Restart
This article discusses an advanced cache optimization to reduce miss penalty by allowing the processor to resume execution as soon as the requested word within a cache block is available.
Continue readingTernary representation of an integer that is a multiple of 5
A step-by-step intuitive explanation for building a DFA to accept ternary numbers that are multiples of 5. A general formula is derived and using that, the transition table of the DFA is computed.
Continue readingPseudo-LRU Tree Implementation
A 4-block cache is visualized as the nodes of a tree to approximate LRU. The different configurations are discussed in detail to point out the recency of blocks and how the configuration changes upon cache reference.
Continue reading