欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
会议
> 会议详情页
An Efficient Trip Planning Algorithm Under Constraints
所属机构名称:东北大学
会议名称:10th conference on Web information and system application (WISA 2013)
时间:2013.11
成果类型:会议
相关项目:社会网络中多元约束条件下的隐私保护关键技术研究
同会议论文项目
社会网络中多元约束条件下的隐私保护关键技术研究
期刊论文 25
会议论文 13
获奖 3
同项目会议论文
Efficiently Anonymizing Social Networks with Reachability Preservation
Improving Regular-Expression Matching on Strings Using Negative Factors
Cache-Aware Parallel Approximate Matching and Join Algorithms Using BWT
Minimizing Explanations for Missing Answers to Queries on Databases
Efficient Direct Search on Compressed Genomic Data
Obtaining K-Obfuscation for Profile Privacy in Social Networks
Efficent Direct Search on Compressed Genomic Data
A Secure K-Automorphism Privacy Preserving Approach with High Data Utility in Social Networks
Protecting Sensitive Relationships against Inference Attacks in Social Networks
An Improved Algorithm to Enhance the Utilization of Shortest Path Caches
A Generalization Based Approach for Anonymizing Weighted Social Network Graphs
Protecting Sensitive Labels in Weighted Social Networks