I am working on some sparse representation models. I was wondering if its difficult to implement a version of distance.jl so that one could write:
r=pairwise(spzeros(n,n),Euclidean(),A,B,threshold) and produce a sparse output with distances only where Euclidean(A,B)<threshold. Not sure how the "engine" works in distance though, maybe the whole array HAS to be calculated (for performance) before one can apply the threshold. distance.jl has great performance but I just have to big Arrays :-(
