activity
20172022
most citedCampus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene

57 citations · 107 across the 8 of their papers we have counts for

collaborators

10 papers

cs.DS2021

Efficient and Effective Algorithms for Revenue Maximization in Social Advertising

Kai Han, Benwei Wu, Jing Tang +3

We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment…

cs.DS2021

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

Kai Han, Shuang Cui, Tianshuai Zhu +3

Submodular optimization has numerous applications such as crowdsourcing and viral marketing. In this paper, we study the fundamental problem of non-negative submodular function max…

cs.CR202140 cited

Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives

Yuming Huang, Jing Tang, Qianhao Cong +2

Proof-of-Work (PoW) is the most widely adopted incentive model in current blockchain systems, which unfortunately is energy inefficient. Proof-of-Stake (PoS) is then proposed to ta…

cs.CV202057 cited

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

Xinke Li, Chongshou Li, Zekun Tong +5

Learning on 3D scene-based point cloud has received extensive attention as its promising application in many fields, and well-annotated and multisource datasets can catalyze the de…

cs.DS2020

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

Jing Tang, Xueyan Tang, Andrew Lim +3

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we r…

cs.SI20203 cited

Efficient Approximation Algorithms for Adaptive Influence Maximization

Keke Huang, Jing Tang, Kai Han +5

Given a social network and an integer , the influence maximization (IM) problem asks for a seed set of nodes from to maximize the expected number of nodes influe…