Graduate work at UT Dallas across machine learning, snow simulation, real time 3D graphics, graph algorithms, and classical AI solvers. Every project below has an inline live demo. Click any to read the full page.
ml.harshithakamma.com
01. MACHINE LEARNING
Four classifiers, no servers.
From n gram smoothing on hotel reviews to a CNN plus LSTM image captioner trained with PySpark. Every model is exported to ONNX or TensorFlow.js so inference runs inside this page.
The arc moves chronologically. Classical statistical NLP first. Then distributed Naive Bayes on three public spam corpora. Then feed forward and recurrent neural networks for sentiment. And finally a multi modal CNN plus LSTM that generates captions for images you upload. Each demo runs entirely in your browser.
Read the page snow.harshithakamma.com
02. SNOW SIMULATION
Snow as a fracturing continuum.
Snow is not quite a solid and not quite a fluid. It piles, fractures, compacts, and flows depending on how you push it. Simulating it convincingly is what the Material Point Method was designed for. This page shows it implemented from scratch in Rust, in both two and three dimensions, compiled to WebAssembly so you can throw snowballs at walls in your browser.
Read the page graphics.harshithakamma.com
03. INTERACTIVE 3D GRAPHICS
Seven stages, one rendering pipeline.
A semester long OpenGL and C plus plus progression from a hello shader to a fully lit scene with skeletal bone animation. Ported to three.js so every stage runs in your browser. Alongside a side by side comparison of the same particle system in SVG and Canvas.
Read the page graphs.harshithakamma.com
04. GRAPH ALGORITHMS
Structural analysis on Facebook.
PageRank, triangle counts, connected components, k core peeling, and exact network reliability polynomials. Over a 22,000 node Facebook musae graph and any edge list you upload. All algorithms reimplemented in TypeScript and visualized with sigma.js.
Read the page solvers.harshithakamma.com
05. CLASSICAL AI SOLVERS
Search, with the lights on.
Backtracking with forward checking for constraint satisfaction. Resolution refutation for propositional SAT. Java solvers ported to TypeScript with editors for your own problems and a visualizer that traces the search.
Read the page