Sciweavers

105 search results - page 5 / 21
» nn 2010
Sort
View
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
14 years 4 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...
FOCS
2010
IEEE
13 years 8 months ago
Testing Properties of Sparse Images
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n
Gilad Tsur, Dana Ron
TKDE
2010
185views more  TKDE 2010»
13 years 9 months ago
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
ISAAC
2010
Springer
231views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Entropy-Bounded Representation of Point Grids
We give the first fully compressed representation of a set of m points on an n
Arash Farzan, Travis Gagie, Gonzalo Navarro
DNIS
2010
Springer
250views Database» more  DNIS 2010»
14 years 5 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...