Hi, I am looking for an efficient algorithm to search for k-median across disjointed vectors.
For example, I have 10 different size arrays of floats (size varies from 20k to 100k elements) from which I would like to get 1000th element of the combined set (total set is 500k elements). Currently I am extracting 1000 elements from each array and doing merge-sort. Since this operation is performed atleast 100k times (i.e. a set of 100k * 500k elements), the constant factor of shipping elements across a different machine is very high. I am wondering if there is a better approach to limit the amount of data passed around while keeping the efficiency. Any help is appreciated! Regards, krisp --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
