This article is concerned with matching feature vectors in a one-to-one fashion across large collections of datasets. Formulating this task as multidimensional assignment problem decomposable costs (MDADC), we develop fast algorithms time complexity roughly linear the number n datasets and space small fraction data size. These remarkable properties hinge on using squared Euclidean distance diss...
