If it needs to be fast, I would just write the logic out with for loops.
On Tue, Aug 12, 2014 at 10:59 AM, tcs <[email protected]> wrote: > In other words, is there anything more optimized for this problem than > concatenating findn and the distance measure of which I pick the minimum? > > > On Tuesday, August 12, 2014 10:24:47 AM UTC-4, tcs wrote: >> >> Hi julia-users, >> >> I am looking for a function that takes a two-dimensional matrix and a set >> of matrix indices as inputs and spits out the nearest non-zero element in >> taxicab distance over the matrix index. >> I am asking for your advice because this function needs to be very fast >> as I have to do this search many times. Any ideas or advice would be >> greatly appreciated. >> >> Thanks! >> >
