Sentence examples for closest pairs from inspiring English sources

This paper addresses the problem of finding the K closest pairs between two spatial datasets (the so-called, K closest pairs query, K-CPQ), where each dataset is stored in an R-tree.

The experimental evaluation suggests that the network expansion framework has superior performance for range search and nearest neighbors, while Euclidean restriction is better for closest pairs and joins.

In this paper we present a novel approximate algorithm to calculate the top-k closest pairs join query of two large and high dimensional data sets.

These frameworks are successfully applied to the most popular spatial queries, namely nearest neighbors, range search, closest pairs, and e-distance joins, in the context of spatial network databases.

The most representative and known DBQs are the K Nearest Neighbors Query (KNNQ), ρ Distance Range Query (ρDRQ), K Closest Pairs Query (KCPQ) and ρ Distance Join Query (ρDJQ).

Specifically, a k-NK query obtains k closest pairs of vertices, (vi,ui), in the RDF graph, that contain two given keywords q and w, respectively, such that ui is the nearest vertex of vi that contains the keyword w.

The closest pair of beaches - Stafilos and Agnondas - are nice enough and can be reached on foot, but it's worth heading north to visit Panormos.

If confirmed, the whirling dervishes are revolving twice as fast as the next closest pair.

After estimating the LOS component and deducing the diffuse one, we consider first the closest pair of antenna-elements (Ant.0-Ant.1).

If there are unbonded pairs, but none of them are close enough to the default bond distance, then only the closest pair of atoms is connected.

Further, we propose O(n2k log nk) α nk)) time algorithms for finding the closest and furthest pair problems, and present a lower bound of Ω(n2) for the closest pair problem when k is constant.