نتایج جستجو برای: nearest points
تعداد نتایج: 293782 فیلتر نتایج به سال:
Continuous K nearest neighbor queries (C-KNN) are defined as finding the nearest points of interest along an entire path (e.g., finding the three nearest gas stations to a moving car on any point of a pre-specified path). The result of this type of query is a set of intervals (or split points) and their corresponding KNNs, such that the KNNs of all points within each interval are the same. The ...
Any connected plane nearest neighbor graph has diameter Ω(n). This bound generalizes to Ω(n) in any dimension d. For any set of n points in the plane, we define the nearest neighbor graph by selecting a unique nearest neighbor for each point, and adding an edge between each point and its neighbor. This is a directed graph with outdegree one; thus it is a pseudo-forest. Each component of the pse...
This paper introduces a new proximity graph, called the k-Semi-Yao graph (k-SYG), on a set P of points in R, which is a supergraph of the k-nearest neighbor graph (k-NNG) of P . We provide a kinetic data structure (KDS) to maintain the k-SYG on moving points, where the trajectory of each point is a polynomial function whose degree is bounded by some constant. Our technique gives the first KDS f...
We suggest a simple modification to the kd-tree search algorithm for nearest neighbor search resulting in an improved performance. The Kd-tree data structure seems to work well in finding nearest neighbors in low dimensions but its performance degrades even if the number of dimensions increases to more than three. Since the exact nearest neighbor search problem suffers from the curse of dimensi...
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
Distance methods and their estimators of density may have biased measurements unless the studied stand of trees has a random spatial pattern. This study aimed at assessing the effect of spatial arrangement of wild pistachio trees on the results of density estimation by using the nearest individual sampling method in Zagros woodlands, Iran, and applying a correction factor based on the spatial p...
we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...
In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic behaviour of the total power-weighted length of the ONG on uniform random points in (0, 1)d. In particular, for d = 1 and weight exponent α > 1/2, the limitin...
We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single Newton step following a reduction in the value of the penalty parameter. Proofs of convergence of the algorithm are given. Various other versions of exterior penalty algorithms f...
The relationships between the generalized directional derivative of the distance function and the existence of nearest points as well as some geometry properties in Banach spaces are studied. It is proved in the present paper that the condition that for each closed subset G of X and x ∈ X \ G, the Clarke, Michel-Penot, Dini or modified Dini directional derivative of the distance function is 1 o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید