Jing Tang

CoRR, 2024

Link Recommendation to Augment Influence Diffusion with Provable Guarantees.

[BibT_eX]

[DOI]

Xiaolong Chen

Yifan Song

Proceedings of the ACM on Web Conference 2024, 2024

DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

AlignedCoT: Prompting Large Language Models via Native-Speaking Demonstrations.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2024, 2024

Energy-Calibrated VAE with Test Time Free Lunch.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2024, 2024

2023

2-hop+ Sampling: Efficient and Effective Influence Estimation.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2023

Efficient Estimation of Pairwise Effective Resistance.

[BibT_eX]

[DOI]

Renchi Yang

Proc. ACM Manag. Data, 2023

Speak Like a Native: Prompting Large Language Models in a Native Style.

[BibT_eX]

[DOI]

CoRR, 2023

Optimal Batched Best Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2023

Practical Parallel Algorithms for Non-Monotone Submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2023

Randomized Pricing with Deferred Acceptance for Revenue Maximization with Submodular Objectives.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Node-wise Diffusion for Scalable Graph Learning.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Constrained Subset Selection from Data Streams for Profit Maximization.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Efficient Approximation Algorithms for Spanning Centrality.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

How Fragile is Relation Extraction under Entity Replacements?

[BibT_eX]

[DOI]

Proceedings of the 27th Conference on Computational Natural Language Learning, 2023

Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Optimal price profile for influential nodes in online social networks.

[BibT_eX]

[DOI]

Yuqing Zhu

VLDB J., 2022

Influence Maximization Revisited: Efficient Sampling with Bound Tightened.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2022

Chromatic Correlation Clustering, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Noisy Interactive Graph Search.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Distributed Influence Maximization for Large-Scale Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Cost-Effective Algorithms for Average-Case Interactive Graph Search.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Analysis of Influence Contribution in Social Advertising.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Streaming Algorithms for Constrained Submodular Maximization.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

Structure-Aware Label Smoothing for Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2021

The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2021

Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Efficient and Effective Algorithms for Revenue Maximization in Social Advertising.

[BibT_eX]

[DOI]

Laks V. S. Lakshmanan

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Optimal Streaming Algorithms for Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Randomized Algorithms for Submodular Function Maximization with a k-System Constraint.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Efficient approximation algorithms for adaptive influence maximization.

[BibT_eX]

[DOI]

VLDB J., 2020

Pricing Influential Nodes in Online Social Networks.

[BibT_eX]

[DOI]

Yuqing Zhu

Proc. VLDB Endow., 2020

Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene.

[BibT_eX]

[DOI]

Proceedings of the MM '20: The 28th ACM International Conference on Multimedia, 2020

Efficient Approximation Algorithms for Adaptive Target Profit Maximization.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019

Efficient and Effective Algorithms for Clustering Uncertain Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Regulating Monopolistic ISPs Without Neutrality.

[BibT_eX]

[DOI]

Richard T. B. Ma

IEEE J. Sel. Areas Commun., 2019

Efficient Approximation Algorithms for Adaptive Seed Minimization.

[BibT_eX]

[DOI]

Keke Huang

Xiaokui Xiao

Laks V. S. Lakshmanan

Aixin Sun

Andrew Lim

Proceedings of the 2019 International Conference on Management of Data, 2019

2018

Traffic-Optimized Data Placement for Social Media.

[BibT_eX]

[DOI]

IEEE Trans. Multim., 2018

Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

An efficient and effective hop-based approach for influence maximization in social networks.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2018

Efficient Algorithms for Adaptive Influence Maximization.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

Online Processing Algorithms for Influence Maximization.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Management of Data, 2018

Towards Profit Maximization for Online Social Network Providers.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017

Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016

Profit maximization for viral marketing in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Conference on Network Protocols, 2016

2015

Optimizing Inter-server Communication for Online Social Networks.

[BibT_eX]

[DOI]