Sciweavers

105 search results - page 5 / 21
» Dynamic travel time provision for road networks
Sort
View
GIS
2005
ACM
15 years 10 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...
INFOCOM
2009
IEEE
15 years 4 months ago
VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks
—This paper proposes a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design uniquely leverages upon the facts that (i) the movement...
Jaehoon Jeong, Yu Gu, Tian He, David Du
4OR
2010
148views more  4OR 2010»
14 years 7 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 9 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
TWC
2008
156views more  TWC 2008»
14 years 9 months ago
Dynamic Bandwidth Allocation for QoS Provisioning in IEEE 802.16 Networks with ARQ-SA
In this paper, bandwidth allocation, in terms of distributing available data slots among different users, is studied for QoS provisioning in IEEE 802.16 networks. By considering th...
Weiwei Wang, Zihua Guo, Xuemin Shen, Changjia Chen...