51 search results - page 10 / 11 » A case for time-dependent shortest path computation in spati... |
WSDM
2009
ACM
14 years 23 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
WIOPT
2005
IEEE
13 years 11 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
GIS
2005
ACM
14 years 7 months ago
2005
ACM
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
IWCMC
2006
ACM
13 years 12 months ago
2006
ACM
Multipath fading heavily contributes to the unreliability of wireless links, causing fairly large deviations from link quality predictions based on path loss models; its impact on...
DIALM
2003
ACM
13 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...