1888 search results - page 17 / 378 » Algorithms for Querying by Spatial Structure |
177
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the...
183
click to vote
GIS
2007
ACM
15 years 11 months ago
2007
ACM
The development of areas such as remote and airborne sensing, location based services, and geosensor networks enables the collection of large volumes of spatial data. These datase...
PVLDB
2010
14 years 4 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
101
click to vote
ISMIS
1997
Springer
15 years 2 months ago
1997
Springer
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
GEOS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...