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 find it, which I would like to discuss:| Can Güney Aksakalli
Comparison of different clutering algorithms: Lyod's, Hartgian's, and McQueen's| Can Güney Aksakalli
Alternative approaches to map inheritance to relational model| Can Güney Aksakalli
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.| Can Güney Aksakalli
Bug motion planning algorithms implementation on Webots Simulation with Pioneer robot (Bug0, bug1 and bug2)| Can Güney Aksakalli
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.| Can Güney Aksakalli
Complexity of an algorithm is determined as consumed resources like time and space. It depends not only on the number of input elements but also on their ord...| aksakalli.github.io
The MinHash method was invented by Andrei Broder, when he was working on Altavista search engine. This local sensitive hashing method is used for estimating ...| aksakalli.github.io