63 citations · 168 across the 57 of their papers we have counts for
7 papers · 1 filter
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising
Jia Zhang, Zheng Wang, Qian Li +4
In this work, we study the guaranteed delivery model which is widely used in online display advertising. In the guaranteed delivery scenario, ad exposures (which are also called im…
Randomized Mechanisms for Selling Reserved Instances in Cloud
Jia Zhang, Weidong Ma, Tao Qin +2
Selling reserved instances (or virtual machines) is a basic service in cloud computing. In this paper, we consider a more flexible pricing model for instance reservation, in which…
On the Optimality of Tape Merge of Two Lists with Similar Size
Qian Li, Xiaoming Sun, Jialin Zhang
The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp \cite{taocp} independently…
A Tighter Relation between Sensitivity and Certificate Complexity
Kun He, Qian Li, Xiaoming Sun
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging proble…
On the Sensitivity Complexity of -Uniform Hypergraph Properties
Qian Li, Xiaoming Sun
In this paper we investigate the sensitivity complexity of hypergraph properties. We present a -uniform hypergraph property with sensitivity complexity …
Cumulative Activation in Social Networks
Xiaohan Shan, Wei Chen, Qiang Li +2
Most studies on influence maximization focus on one-shot propagation, i.e. the influence is propagated from seed users only once following a probabilistic diffusion model and users…