By shriphani on July 31, 2012
Chris helped me flesh out a couple of bugs with my VAD implementation (the Spectral Flatness Measure was computer incorrectly). Thanks a bunch. You can get the latest build here
By shriphani on September 22, 2010
Today on engadget I found a project for the iOS devices (http://www.engadget.com/2010/09/22/iphone-awareness-app-selectively-filters-outside-noises-into-yo/) that closely mirrored my project (http://shriphani.com/blog/listener). The app seems to do a bit more than mine does. First, I do not send the sounds back to the user through the headphones while this does. They probably use a better voice activity detection algorithm […]
By shriphani on August 9, 2010
A list of additions to Listener. The additions include a new Voice Activity Detection algorithm.
By shriphani on July 2, 2010
Using the Bellman-Ford Single Source Shortest Path algorithm to detect triangular arbitrage.
By shriphani on May 20, 2010
Two implementations of a disjoint set data structure and an implementation of kruskal's algorithm.
Posted in Computer Science, python | Tagged "disjoint sets", "kruskal", "path compression", "weighted union", algorithms, analysis of algorithms, Computer Science, cs, purdue, python | Leave a response
By shriphani on May 11, 2008
For a very long time, I was under the impression that variables in Python were like boxes and I could throw objects in them. So, according to me, if I wrote a piece of code that went: >>> a = "Shriphani Palakodety" >>> print a Shriphani Palakodety I used to think that there is a […]