Skip to content

Tag Archives: matix

fast top-k similarity computation in matlab

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 representation while simultaneously […]