63 citations · 168 across the 57 of their papers we have counts for
5 papers · 1 filter
How to select the largest k elements from evolving data?
Qin Huang, Xingwu Liu, Xiaoming Sun +1
In this paper we investigate the top--selection problem, i.e. determine the largest, second largest, ..., and the -th largest elements, in the dynamic data model. In this mod…
Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games
Qizhi Fang, Bo Li, Xiaoming Sun +2
Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts t…
On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model
Yi Li, Xiaoming Sun, Chengu Wang +1
We study the communication complexity of linear algebraic problems over finite fields in the multi-player message passing model, proving a number of tight lower bounds. Specificall…
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
Xiaoming Sun, Jia Zhang, Jialin Zhang
The classical secretary problem investigates the question of how to hire the best secretary from candidates who come in a uniformly random order. In this work we investigate a…
Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network
Peng Zhang, Wei Chen, Xiaoming Sun +2
A topic propagating in a social network reaches its tipping point if the number of users discussing it in the network exceeds a critical threshold such that a wide cascade on the t…