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. The algorithm has worst case time complexity OðdnkÞ and space complexity OðndÞ and guarantees a solution within a Oðd1þ1tÞ factor of the exact one, where t 2 {1,2, . . . ,1} denotes the Minkowski metrics Lt of interest and d the dimensionality. It m...

This article investigates some properties of quasi-cyclic and cyclic Jungck modified TS-iterative schemes in complete metric spaces and Banach spaces. In particular, properties of convergence of distances and sequences associated with the self-mappings which define the Jungck modified TS-iterative procedures are studied as well as some properties concerning the convergence of the solution to co...

best approximation results provide an approximate solution to the fixed point equation $tx=x$, when the non-self mapping $t$ has no fixed point. in particular, a well-known best approximation theorem, due to fan cite{5}, asserts that if $k$ is a nonempty compact convex subset of a hausdorff locally convex topological vector space $e$ and $t:krightarrow e$ is a continuous mapping, then there exi...