2262 search results - page 41 / 453 » Points with large quadrant-depth |
116
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
100
click to vote
SSDBM
2003
IEEE
15 years 5 months ago
2003
IEEE
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
114
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
116
click to vote
TROB
2008
14 years 11 months ago
2008
In this paper, we describe a system that can carry4 out simultaneous localization and mapping (SLAM) in large in-5 door and outdoor environments using a stereo pair moving with 66 ...