存在单个凸多边形障碍时最短路径的隐私保护计算

2007 International Conference on Mobile Data Management Pub Date : 2007-05-01 DOI:10.1109/MDM.2007.52

Ananda Swarup, Das Kannan, Srinathan Ritesh, Kumar Tiwari

{"title":"存在单个凸多边形障碍时最短路径的隐私保护计算","authors":"Ananda Swarup, Das Kannan, Srinathan Ritesh, Kumar Tiwari","doi":"10.1109/MDM.2007.52","DOIUrl":null,"url":null,"abstract":"Shortest path computation has always been a subject of study and research in the history of computer science. In this paper we introduce and initiate the study of the problem of finding the shortest path in a privacy preserving manner, in presence of single convex polygonal obstacle. We also propose an efficient, elegant and simple solution for the problem.","PeriodicalId":393767,"journal":{"name":"2007 International Conference on Mobile Data Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle\",\"authors\":\"Ananda Swarup, Das Kannan, Srinathan Ritesh, Kumar Tiwari\",\"doi\":\"10.1109/MDM.2007.52\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shortest path computation has always been a subject of study and research in the history of computer science. In this paper we introduce and initiate the study of the problem of finding the shortest path in a privacy preserving manner, in presence of single convex polygonal obstacle. We also propose an efficient, elegant and simple solution for the problem.\",\"PeriodicalId\":393767,\"journal\":{\"name\":\"2007 International Conference on Mobile Data Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Mobile Data Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2007.52\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Mobile Data Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2007.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

最短路径计算一直是计算机科学史上的一个研究课题。本文引入并研究了在存在单个凸多边形障碍物的情况下，以隐私保护的方式寻找最短路径的问题。我们还提出了一个高效、优雅、简单的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle

Shortest path computation has always been a subject of study and research in the history of computer science. In this paper we introduce and initiate the study of the problem of finding the shortest path in a privacy preserving manner, in presence of single convex polygonal obstacle. We also propose an efficient, elegant and simple solution for the problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Mobile Data Management

自引率

0.00%

发文量

期刊最新文献

A Failure Tolerating Atomic Commit Protocol for Mobile Environments Scalable Hybrid Routing in Very Large Sensor Networks Towards Entity-Centric Wide-Area Context Discovery On the Integration of Data Stream Clustering into a Query Processor for Wireless Sensor Networks Infrastructure for Data Processing in Large-Scale Interconnected Sensor Networks