Sciweavers

314 search results - page 23 / 63
» Succinct nearest neighbor search
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 9 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
DNIS
2010
Springer
250views Database» more  DNIS 2010»
14 years 2 months ago
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
14 years 1 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
GIS
2006
ACM
14 years 9 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
PAMI
1998
93views more  PAMI 1998»
13 years 7 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
Carlo Tomasi, Roberto Manduchi