Time-Dependent Reachability Analysis: A Data-Driven Approach
暂无分享,去创建一个
[1] Yang Du,et al. Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[2] Jun Luo,et al. Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).
[3] John Krumm,et al. Hidden Markov map matching through noise and sparseness , 2009, GIS.
[4] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[5] Yufei Tao,et al. Query Processing in Spatial Network Databases , 2003, VLDB.
[6] Marios Hadjieleftheriou,et al. R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.
[7] P. Pons,et al. Selected Topics : Prehospital Care EIGHT MINUTES OR LESS : DOES THE AMBULANCE RESPONSE TIME GUIDELINE IMPACT TRAUMA PATIENT OUTCOME ? , 2002 .
[8] Jeffrey Xu Yu,et al. Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.
[9] G. Lugano,et al. Travel time, resource reachability and quality of living in urban contexts: A case study from Slovakia , 2017, 2017 Smart City Symposium Prague (SCSP).
[10] Johann Gamper,et al. Computing isochrones in multi-modal, schedule-based transport networks , 2008, GIS '08.
[11] Johann Gamper,et al. Determining Objects within Isochrones in Spatial Network Databases , 2010, ADBIS.