prateek22sri Goto Github PK

15-puzzle-variant

Implementation of the game 15-Puzzle solver which finds the shortest possible sequence of moves that restores the canonical configuration given an initial board configuration provided in a text file called "input.txt" by the user.

blink-led-virtex

Blink Led on Virtex Ultrascale+ board - VCU118

blinking-leds

blinking led and simple pulse wave modulation on Pynq-Z1 board

chess-engine

Chess playing engine using heuristic based minimax with alpha-beta pruning

emacs-config

Configuration of my Doom-Emacs

email-spam-classifier

Spam Classifier using Naive Bayes and Decision Tree method

glowing-led

Implementation of Pulse Wave Modulation in verilog on Pynq-Z1 board (Zynq 7020 chip)

graph-delta-stepping-sssp

A python implementation of a graph algorithm for solving the single source shortest path problem called Delta Stepping Algorithm

graph500

Graph500 reference implementations

hadoop-blast

Implementation of "Basic Local Alignment Search Tool" in Hadoop for DNA analysis

hbase-word-count

Implementation of word count algorithm using HBase

image-orientation-detector

Implementation of K-nearest neighbors, adaptive boosting, and neural networks to detect the orientation of an image

mapreduce-basic-statistics

Implementation of basic statistics such as min, max, average, and standard deviation of a given data set using MapReduce paradigm

mapreduce-page-rank

Implementation of web page ranking algorithm using the MapReduce paradigm

mapreduce-word-count

Implementing MapReduce's word count algorithm

mountain-ridge-detector

Implementation of mountain ridge detector using monte-carlo markov chain

n-k-coh-coh

Game of N-K-Coh-Coh (Inverse Tic-tac-toe)

nqueens

N-queens is a typical search problem in Artificial Intelligence. In a chess board of NxN dimension, it is an algorithm to place N number of queens such that no queen can attack each other

parallel-sssp-openmp

A parallel variant of a graph algorithm (dijkstra’s algorithm) using OpenMP on a Cray machine (XE6/XK7) and performed the benchmarking for single node up to 32 processing units

part-of-speech-tagger

Two implementations of part-of-speech tagger. Long implementation uses Viterbi algorithm and the short uses NLTK's HMM function

pos-tagger-forward-backward

Implementation of forward-backward algorithm for part-of-speech tagging

pos-tagger-hmm-naive-bayes

Part-of-Speech tagger using word count, naive bayes and hmm approach

prateek22sri.github.io

runtime-system-benchmarking

Conducted a comparative analysis on scaling results for graph algorithms like single source shortest path (SSSP) algorithm using multiple runtime systems thereby reducing time to solution for graph processing with message driven runtime systems (like Charm++, HPX5), parallel boost graph library, or Graph500

sentiment-analysis

Implementation of opinion mining on Kaggle IMDB dataset and Stanford Large Movie Review Dataset

simplified-global-positioning-system

Implementation of a simplified GPS system using search algorithm

tetris

Game of Tetris

text-conversation-finder

Every book has conversations and this piece of code finds the total conversations that happened in a text

text-genre-detection

A genre detection tool for classifying books according to their genres such as science fiction, science, history, math etc.

topic-classifier

Implementation of Naive Bayes' classifier to classify topics from text