Showing 1–20 of 101 results
/ Date/ Name
Dec 30, 2009The Hardness and Approximation Algorithms for L-DiversityJun 5, 2013Efficient Single-Source Shortest Path and Distance Queries on Large GraphsJun 16, 2016Collecting and Analyzing Data from Smart Device Users with Local Differential PrivacyApr 3, 2014Influence Maximization: Near-Optimal Time Complexity Meets Practical EfficiencyApr 9, 2013Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and PracticeSep 30, 2009Differential Privacy via Wavelet TransformsMar 26, 2010Transparent Anonymization: Thwarting Adversaries Who Know the AlgorithmApr 14, 2016SLING: A Near-Optimal Index Structure for SimRankAug 1, 2012Keyword-aware Optimal Route SearchMar 3, 2020MOTS: Minimax Optimal Thompson SamplingApr 14, 2020Efficient Approximation Algorithms for Adaptive Influence MaximizationAug 28, 2019Efficient Algorithms for Approximate Single-Source Personalized PageRank QueriesOct 22, 2020Fast Approximate CoSimRanks via Random ProjectionsSep 20, 2017ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic GraphsMar 22, 2016Recursive Neural Conditional Random Fields for Aspect-based Sentiment AnalysisNov 29, 2017Cost-Effective Seed Selection in Online Social NetworksJul 9, 2017GraphMP: An Efficient Semi-External-Memory Big Graph Processing System on a Single MachineJun 19, 2024Effective Edge-wise Representation Learning in Edge-Attributed Bipartite GraphsAug 19, 2022Measuring Friendship Closeness: A Perspective of Social Identity TheoryFeb 13, 2025KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAG