VLDB 2026 Research / reviewers in the wild / expert
Qiang Li 0043
dblp:72/872-43
· DBLP profile ↗
5ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Higher order monotonicity and submodularity of influence in social networks: From local to global
Wei Chen 0013, Qiang Li 0043, Xiaohan Shan, Xiaoming Sun 0001, Jialin Zhang 0001 |
Inf. Comput. | 2 |
| 2019 | Cumulative activation in social networks
Xiaohan Shan, Wei Chen 0013, Qiang Li 0043, Xiaoming Sun 0001, Jialin Zhang 0001 |
Sci. China Inf. Sci. | 3 |
| 2017 | Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed AdvertisingabstractIn this work, we study the guaranteed delivery model which is widely used in online advertising. In the guaranteed delivery scenario, ad exposures (which are also called impressions in some works) to users are guaranteed by contracts signed in advance between advertisers and publishers. A crucial problem for the advertising platform is how to fully utilize the valuable user traffic to generate as much as possible revenue. Different from previous works which usually minimize the penalty of unsatisfied contracts and some other cost (e.g. representativeness), we propose the novel consumption minimization model, in which the primary objective is to minimize the user traffic consumed to satisfy all contracts. Under this model, we develop a near optimal method to deliver ads for users. The main advantage of our method lies in that it consumes nearly as least as possible user traffic to satisfy all contracts, therefore more contracts can be accepted to produce more revenue. It also enables the publishers to estimate how much user traffic is redundant or short so that they can sell or buy this part of traffic in bulk in the exchange market. Furthermore, it is robust with regard to priori knowledge of user type distribution. Finally, the simulation shows that our method outperforms the traditional state-of-the-art methods. Jia Zhang 0004, Qian Li 0012, Jialin Zhang 0001, Yanyan Lan, Qiang Li 0043, Xiaoming Sun 0001 |
AAAI | 6 |
| 2017 | Influence Maximization with ε-Almost Submodular Threshold Functions
Qiang Li 0043, Wei Chen 0013, Xiaoming Sun 0001, Jialin Zhang 0001 |
NIPS | 1 |
| 2016 | The Routing of Complex Contagion in Kleinberg's Small-World Networks
Wei Chen 0013, Qiang Li 0043, Xiaoming Sun 0001, Jialin Zhang 0001 |
COCOON | 2 |