Network Centrality Measures and Their Visualization

Jul 17, 2017

Centrality is a term to describe importance of individual nodes in a graph. There has been a lot of research carried out in this topic for network analysis to answer the question, “Which are the most important nodes (vertices) in a graph?” Here is the list of different metrics to...

Approximating Jaccard similarity with MinHash

Mar 1, 2016

Jaccard similarity of large sets can be approximated with MinHash method.

k-Means Clustering Algorithms

Feb 4, 2016

Comparison of different clutering algorithms: Lyod's, Hartgian's, and McQueen's

Mapping Inheritance to Relational Databases

Jun 16, 2015

Alternative approaches to map inheritance to relational model

Simple HTTP Server in C#

Feb 24, 2014

I wrote a simple C# class to serve static files in a given directory. It is easy to use as other known single line HTTP servers for Python, Ruby, Node.js and so on.

Bug Motion Planning Algorithms

May 16, 2012

Bug motion planning algorithms implementation on Webots Simulation with Pioneer robot (Bug0, bug1 and bug2)

Database Normalization and Normal Forms with an Example

Mar 12, 2012

Database normalization is essential procedure to avoid inconsistency in a relational database management system. This article aims to explain database normalization in a nutshell by giving a simple and effective example.

Quicksort, Insertion Sort and Radix Sort Comparison

Nov 29, 2011

An experiment on time complexity analysis of quicksort, insertion sort and radix sort algorithms with different input orders.