96 search results - page 14 / 20 » Variations of R-Tree Structure for Indexing of Spatial Objec... |
GIS
2002
ACM
13 years 6 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
ADBIS
2003
Springer
13 years 12 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
DEXA
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. In this paper, a new approach for retrieval from semistructured photographic collections is described. We have developed a retrieval model based on the Dempster-Shafer th...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...