Intelligent route planning on large road networks with efficiency and privacy
暂无分享,去创建一个
Tao Peng | Guojun Wang | Shaobo Zhang | Panlin Hou | Qin Liu | Shaobo Zhang | Tao Peng | Guojun Wang | Qin Liu | Panlin Hou
[1] Xiangjian He,et al. Enabling Privacy-Preserving Shortest Distance Queries on Encrypted Graph Data , 2021, IEEE Transactions on Dependable and Secure Computing.
[2] Ignaz Rutter,et al. Search-space size in contraction hierarchies , 2016, Theor. Comput. Sci..
[3] Yin Yang,et al. Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks , 2016, Proc. VLDB Endow..
[4] Shaobo Zhang,et al. A caching and spatial K-anonymity driven privacy enhancement scheme in continuous location-based services , 2019, Future Gener. Comput. Syst..
[5] George Karypis,et al. A Software Package for Partitioning Unstructured Graphs , Partitioning Meshes , and Computing Fill-Reducing Orderings of Sparse Matrices Version 5 . 0 , 1998 .
[6] Daniel Delling,et al. Customizable Point-of-Interest Queries in Road Networks , 2015, IEEE Trans. Knowl. Data Eng..
[7] Raymond Chi-Wing Wong,et al. Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks , 2014, Proc. VLDB Endow..
[8] Weijia Jia,et al. A novel trust mechanism based on Fog Computing in Sensor-Cloud System , 2020, Future Gener. Comput. Syst..
[9] Jianxin Wang,et al. Resisting re-identification mining on social graph data , 2017, World Wide Web.
[10] Tinghuai Ma,et al. A privacy preserving location service for cloud-of-things system , 2019, J. Parallel Distributed Comput..
[11] Jiannong Cao,et al. On-Line Anomaly Detection With High Accuracy , 2018, IEEE/ACM Transactions on Networking.
[12] Jie Wu,et al. Burstiness-Aware Resource Reservation for Server Consolidation in Computing Clouds , 2016, IEEE Transactions on Parallel and Distributed Systems.
[13] Qin Liu,et al. Dynamic Keyword Search With Hierarchical Attributes in Cloud Computing , 2018, IEEE Access.
[14] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[15] Kian-Lee Tan,et al. G-tree: an efficient index for KNN search on road networks , 2013, CIKM.
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] Sankita J. Patel,et al. k-NMF Anonymization in Social Network Data Publishing , 2018, Comput. J..
[18] Qing Zhu,et al. When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks , 2018, SIGMOD Conference.
[19] Takuya Akiba,et al. Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.
[20] Jeffrey Xu Yu,et al. Outsourcing shortest distance computing with privacy protection , 2012, The VLDB Journal.
[21] Kian-Lee Tan,et al. G-Tree: An Efficient and Scalable Index for Spatial Search on Road Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.
[22] Kim-Kwang Raymond Choo,et al. A trajectory privacy-preserving scheme based on a dual-K mechanism for continuous location-based services , 2020, Inf. Sci..
[23] Andrew V. Goldberg,et al. Computing the shortest path: A search meets graph theory , 2005, SODA '05.
[24] Tao Peng,et al. Multidimensional privacy preservation in location-based services , 2019, Future Gener. Comput. Syst..
[25] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[26] Jeffrey Xu Yu,et al. To Meet or Not to Meet: Finding the Shortest Paths in Road Networks , 2018, IEEE Transactions on Knowledge and Data Engineering.
[27] George Kollios,et al. GRECS: Graph Encryption for Approximate Shortest Distance Queries , 2015, IACR Cryptol. ePrint Arch..
[28] Jie Wu,et al. Preserving Privacy with Probabilistic Indistinguishability in Weighted Social Networks , 2017, IEEE Transactions on Parallel and Distributed Systems.
[29] Donald F. Towsley,et al. Resisting structural re-identification in anonymized social networks , 2010, The VLDB Journal.
[30] Jeffrey Xu Yu,et al. Neighborhood-privacy protected shortest distance computing in cloud , 2011, SIGMOD '11.
[31] Guoliang Li,et al. V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).
[32] Yi Yang,et al. Efficient Route Planning on Public Transportation Networks: A Labelling Approach , 2015, SIGMOD Conference.
[33] Sakti Pramanik,et al. An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..
[34] Guojun Wang,et al. Enabling Verifiable and Dynamic Ranked Search over Outsourced Data , 2019, IEEE Transactions on Services Computing.
[35] Jie Wu,et al. Dynamic access policy in cloud-based personal health record (PHR) systems , 2017, Inf. Sci..
[36] Yaping Lin,et al. Anonymizing popularity in online social networks with full utility , 2017, Future Gener. Comput. Syst..
[37] John C. Mitchell,et al. Privacy-Preserving Shortest Path Computation , 2016, NDSS.
[38] Jie Wu,et al. Achieving reliable and secure services in cloud computing environments , 2017, Comput. Electr. Eng..
[39] Takuya Akiba,et al. Shortest-path queries for complex networks: exploiting low tree-width outside the core , 2012, EDBT '12.
[40] Jie Wu,et al. Online Task Assignment for Crowdsensing in Predictable Mobile Social Networks , 2017, IEEE Transactions on Mobile Computing.