نتایج جستجو برای: nearest point

تعداد نتایج: 551949  

2015
Tim Roughgarden Gregory Valiant

Lectures #1 and #2 discussed “unstructured data”, where the only information we used about two objects was whether or not they were equal. Last lecture, we started talking about “structured data”. For now, we consider structure expressed as a (dis)similarity measure between pairs of objects. There are many such measures; last lecture we mentioned Jaccard similarity (for sets), L1 and L2 distanc...

1997
O. Narayan

Given n data points in d-dimensional space, nearest-neighbor searching involves determining the nearest of these data points to a given query point. Most averagecase analyses of nearest-neighbor searching algorithms are made under the simplifying assumption that d is fixed and that n is so large relative to d that boundary effects can be ignored. This means that for any query point the statisti...

2013
Bruce Merry James E. Gain Patrick Marais

Finding the k nearest neighbours of each point in a point cloud forms an integral part of many point-cloud processing tasks. One common approach is to build a kd-tree over the points and then iteratively query the k nearest neighbors of each point. We introduce a simple modification to these queries to exploit the coherence between successive points; no changes are required to the kd-tree data ...

1998
Juan Carlos Pérez-Cortes Enrique Vidal

In this paper, an algorithm for approximate nearest neighbours search in vector spaces is proposed. It is based on the Extended General Spacefilling Curves Heuristic (EGSH). Under this general scheme, a number of mappings are established between a region of a multidimensional real vector space and an interval of the real line, and then for each mapping the problem is solved in one dimension. To...

Journal: :Random Struct. Algorithms 2008
Mathew D. Penrose Andrew R. Wade

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...

Journal: :Data Knowl. Eng. 2011
Xiaobin Ma Chengyang Zhang Shashi Shekhar Yan Huang Hui Xiong

Article history: Received 6 July 2010 Received in revised form 3 May 2011 Accepted 16 June 2011 Available online 7 July 2011 This paper presents a study of the Multi-Type Reverse Nearest Neighbor (MTRNN) query problem. Traditionally, a reverse nearest neighbor (RNN) query finds all the objects that have the query point as their nearest neighbor. In contrast, anMTRNN query finds all the objects ...

2002
Christian Böhm Florian Krebs

The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the result contains all pairs of similar objects. Well-known are two types of the similarity join, the distance range join where the user defines a distance threshold for the join, and the closest point query or k-distance ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید