Sciweavers

198 search results - page 5 / 40
» Dynamic spatial approximation trees
Sort
View
DOLAP
2003
ACM
14 years 3 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
ICC
2007
IEEE
180views Communications» more  ICC 2007»
14 years 4 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 11 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
TKDE
1998
122views more  TKDE 1998»
13 years 9 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia