In this paper we propose and solve multiple bichromatic mutual nearest neighbor queries in the plane considering multiplicative weighted Euclidean distances. These multiple queries are related to the mutual influence of two sets of facilities of different type, in which facilities of the first type cooperates with facilities of the second type in order to obtain reciprocal benefits. The studied problems find applications, for example, in collaborative marketing. We present a parallel algorithm, to be run on a Graphics Processing Unit, for solving multiple bichromatic mutual nearest neighbor queries. We also present the complexity analysis of the algorithm, and provide and discuss experimental results that show the scalability of our approach. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Fort, M., & Sellarès, J. A. (2014). Solving multiple bichromatic mutual nearest neighbor queries with the GPU. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8505 LNCS, pp. 308–316). Springer Verlag. https://doi.org/10.1007/978-3-662-43984-5_23
Mendeley helps you to discover research relevant for your work.