## Predicting Which Hiragana Character You're Drawing

I tried to take a shot @ the problem shown above. Turns out just high-school level math is sufficient to make a decent classifier for this. In the Japanese alphabet(s), a character is composed of strokes. These strokes have a fixed order. This restriction is pretty much all you need. I grab the stroke's end […]

## Communicating Through Fingertips - Finger Gesture Recognition Using Depth Data

In Prof. Vishy's ML class (cs 590 - top notch course, top notch professor), we don't have a final and instead we are supposed to apply ML to a problem we find interesting. Microsoft gave all of us interns a Kinect this summer so I decided to put it to some use (I don't have […]

## TIL for November 20, 2011

Emil Post actually invented a deterministic computation model. In this model, the machine operated using a FIFO queue. You would read the first symbol in the queue. Delete the appropriate number of symbols from the head Append a string corresponding to the symbol looked up in step #1.This machine has only 1 state. It is […]

## Bellman-Ford Algorithm's Applications - Triangular Arbitrage

Using the Bellman-Ford Single Source Shortest Path algorithm to detect triangular arbitrage.

## 3 CNF SAT Fail.

So, at 2:00 am last night I decided I had completed my 3-CNF-SAT algorithm (which runs in polynomial time!!). Well, here is the pseudocode: ROUTINE(P): -> Make a hashtable 'h' of size 3 * no. of clauses -> For clause p in P: for each 'distinct' variable x in p: h[x] += 1 -> Find […]

## Disjoint Set Data Structure

Two implementations of a disjoint set data structure and an implementation of kruskal's algorithm.

## Weirdest Analyses Ever

This semester I had the fortune of taking Dr. Greg Frederickson's CS 381 (Algorithms) class. And boy did I see weird stuff in there. Below, I have a list of analyses I say are downright the most non-obvious (and in a way beautiful to look at). Edmonds-Karp Algorithm (Max Flow in a network): This algorithm […]