Results 1  10
of
113,350
Continuous Nearest Neighbor Search
, 2002
"... A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s to point e"). The result contains a set of <point, interval> tuples, such that point is the NN of all po ..."
Abstract

Cited by 159 (10 self)
 Add to MetaCart
points in the corresponding interval. Existing methods for continuous nearest neighbor search are based on the repetitive application of simple NN algorithms, which incurs significant overhead. In this paper we propose techniques that solve the problem by performing a single query for the whole
Nearest Neighbor Search Methods
, 2008
"... The motion planning problem consists of finding a valid path for a robot (movable object) from a start configuration to a goal configuration without colliding with any obstacle. Probabilistic road map (PRM) methods use randomization to construct a graph (road map) of collisionfree paths that attemp ..."
Abstract
 Add to MetaCart
improve the performance of path planners. The brute force method of nearest neighbor search has a complexity of O(n2).This increases the running time and hence the cost. The cost of nearestneighbor calls is one of the bottlenecks in the performance of samplingbased motion planning algorithms. Therefore
Nearest Neighbor Search in Multidimensional Spaces
, 1999
"... The Nearest Neighbor Search problem is defined as follows: given a set P of n points, preprocess the points so as to efficiently answer queries that require finding the closest point in P to a query point q. If we are willing to settle for a point that is almost as close as the nearest neighbor, t ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The Nearest Neighbor Search problem is defined as follows: given a set P of n points, preprocess the points so as to efficiently answer queries that require finding the closest point in P to a query point q. If we are willing to settle for a point that is almost as close as the nearest neighbor
Product quantization for nearest neighbor search
, 2010
"... This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensional subspaces and to quantize each subspace separately. A vector is represented by a short code composed of its subspace q ..."
Abstract

Cited by 221 (31 self)
 Add to MetaCart
This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensional subspaces and to quantize each subspace separately. A vector is represented by a short code composed of its subspace
Clusteringbased Nearest Neighbor Searching
"... Abstract—This paper proposes a Clusteringbased Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigidgrid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution, wi ..."
Abstract
 Add to MetaCart
Abstract—This paper proposes a Clusteringbased Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigidgrid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution
Privacy Preserving Nearest Neighbor Search
, 2006
"... Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by p ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
by providing mechanisms to mine the data while giving certain privacy guarantees. In this work we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multiparty computation primitives
NearestNeighbor Searching Under Uncertainty
, 2012
"... Nearestneighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, such as sensor databases, location based services, face recognition, and ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Nearestneighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, such as sensor databases, location based services, face recognition
Nearest Neighbor Search for Relevance Feedback
 In Proc. CVPR
, 2003
"... We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback learning is a popular scheme used in content based image and video retrieval to support highlevel concept queries. This ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback learning is a popular scheme used in content based image and video retrieval to support highlevel concept queries
Approximate Nearest Neighbor Search in ℓp
"... We present a new locality sensitive hashing (LSH) algorithm for capproximate nearest neighbor search in ℓp with 1 < p < 2. For a database of n points in ℓp, we achieve O(dn ρ) query time and O(dn + n 1+ρ) space, where ρ ≤ O((ln c) 2 /c p). This improves upon the previous best upper bound ρ ≤ ..."
Abstract
 Add to MetaCart
We present a new locality sensitive hashing (LSH) algorithm for capproximate nearest neighbor search in ℓp with 1 < p < 2. For a database of n points in ℓp, we achieve O(dn ρ) query time and O(dn + n 1+ρ) space, where ρ ≤ O((ln c) 2 /c p). This improves upon the previous best upper bound ρ
Fast Approximate Nearest Neighbor Search
"... neighbors to the query. However, nding exact l nearest neighbors to the query can be time and memory intensive [10, 9]. Hence, in some applications [10, 5] it may be acceptable to return approximate l nearest neighbors. In this work, we propose a novel fast approximate nearest neighbor search algori ..."
Abstract
 Add to MetaCart
neighbors to the query. However, nding exact l nearest neighbors to the query can be time and memory intensive [10, 9]. Hence, in some applications [10, 5] it may be acceptable to return approximate l nearest neighbors. In this work, we propose a novel fast approximate nearest neighbor search
Results 1  10
of
113,350