51 search results - page 8 / 11 » A case for time-dependent shortest path computation in spati... |
TKDE
2010
13 years 6 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
GIS
2002
ACM
13 years 7 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...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
CLUSTER
2002
IEEE
13 years 7 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...