Vector Space Models (VSMs): A conceptual term in Natural Language Processing. It represents words as set of vectors, these vectors are considered to be the new identifiers… Read more “[Thesis Tutorials I] Understanding Word2vec for Word Embedding I”

# Tag: Algorithms

## Overview: Generative Adversarial Networks – When Deep Learning Meets Game Theory

Before going into the main topic of this article, which is about a new neural network model architecture called Generative Adversarial Networks (GANs), we need to illustrate… Read more “Overview: Generative Adversarial Networks – When Deep Learning Meets Game Theory”

## Another LSTM Tutorial

The figures are taken from this great blog post by Christopher Olah Recurrent Neural Networks Recurrent Neural Networks (RNN) is a type of Neural Networks (NN) that is… Read more “Another LSTM Tutorial”

## [Java] Hopfield Network Implementation

Why Java? Well, actually I have a deep love with this language, I enjoy my time writing a Java code. Also, it is good for me to… Read more “[Java] Hopfield Network Implementation”

## Prim’s Running Time With Heaps

Input: Given a graph with N nodes and M weighted edges, we want to obtain the Minimum Spanning Tree (MST) of the graph. Note: MST is a… Read more “Prim’s Running Time With Heaps”

## The Unsolvability Halting Problem

Definition Halting problem is a famous problem in computer science. The problem is simply we want to prove and know whether a computer program will be halted… Read more “The Unsolvability Halting Problem”

## Solving Time-dependent Graph Using Modified Dijkstra Algorithm

Paper: http://research.microsoft.com/pubs/173806/edbt08tdsp.pdf Content: – Time-dependent Graph – Definition Problem Definition Existed Solutions – Bellman-Ford – Extended A* New Dijkstra Based Algorithm Time-dependent Graph – Definition We can… Read more “Solving Time-dependent Graph Using Modified Dijkstra Algorithm”