When pre-computing a similarity matrix, there there is a large cost in both time and memory for computing pairwise similarity between every sample, O(N^2). There are two main ways to slightly reduce the cost of either one of these demands…
Approximate Hashing: Hashing projects a set of features into a lower dimensional [...]
When asked to help a friend make an easy way to parse a web page, I suggested using regular expressions. PHP is currently my language of choice, so in a few minutes I hacked together a well-documented (in my opinion) php script that will pull apart a table in an otherwise very messy web page. [...]
With a focus on interactive video search for a thesis topic, having a dynamic environment is critical. Within my lab and in my own research, a web-based environment has been the platform of choice. This way we don’t have to worry about specific operating systems, compiling with the right set of binaries, and dealing with [...]