Sciweavers

146 search results - page 15 / 30
» Medoid Queries in Large Spatial Databases
Sort
View
128
Voted
PUK
2003
15 years 1 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
202
Voted
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
16 years 1 months ago
Evaluation of Spatio-Temporal Predicates on Moving Objects
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
Markus Schneider
207
Voted
GIS
2005
ACM
16 years 20 days ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
131
Voted
MM
1994
ACM
143views Multimedia» more  MM 1994»
15 years 3 months ago
Quad-Tree Segmentation for Texture-Based Image Query
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
Jonathan M. Smith, Shih-Fu Chang
86
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 11 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin