activity
20172023
most citedDISCO: Influence Maximization Meets Network Embedding and Deep Learning

23 citations · 33 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DB2023★ 1 cited

One Size Cannot Fit All: a Self-Adaptive Dispatcher for Skewed Hash Join in Shared-nothing RDBMSs

Jinxin Yang, Hui Li, Yiming Si +6

Shared-nothing architecture has been widely adopted in various commercial distributed RDBMSs. Thanks to the architecture, query can be processed in parallel and accelerated by scal…

cs.LG2022

Random Ensemble Reinforcement Learning for Traffic Signal Control

Ruijie Qi, Jianbin Huang, He Li +3

Traffic signal control is a significant part of the construction of intelligent transportation. An efficient traffic signal control strategy can reduce traffic congestion, improve…

cs.DS2021★ 2 cited

Revisiting -Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses

Liu Yingfan, Cheng Hong, Cui Jiangtao

The -nearest neighbor graph (KNNG) on high-dimensional data is a data structure widely used in many applications such as similarity search, dimension reduction and clustering. D…

cs.CV2021★ 1 cited

Enhanced countering adversarial attacks via input denoising and feature restoring

Yanni Li, Wenhui Zhang, Jiawei Liu +3

Despite the fact that deep neural networks (DNNs) have achieved prominent performance in various applications, it is well known that DNNs are vulnerable to adversarial examples/sam…

cs.DB2020★ 2 cited

An Efficient Secure Dynamic Skyline Query Model

Weiguo Wang, Hui Li, Yanguo Peng +4

It is now cost-effective to outsource large dataset and perform query over the cloud. However, in this scenario, there exist serious security and privacy issues that sensitive info…

cs.SI2019★ 23 cited

DISCO: Influence Maximization Meets Network Embedding and Deep Learning

Hui Li, Mengting Xu, Sourav S Bhowmick +3

Since its introduction in 2003, the influence maximization (IM) problem has drawn significant research attention in the literature. The aim of IM is to select a set of k users who…

cs.DS2018★ 1 cited

ONCE and ONCE+: Counting the Frequency of Time-constrained Serial Episodes in a Streaming Sequence

Hui Li, Sizhe Peng, Jian Li +3

As a representative sequential pattern mining problem, counting the frequency of serial episodes from a streaming sequence has drawn continuous attention in academia due to its wid…

cs.DB2017★ 3 cited

Time is What Prevents Everything from Happening at Once: Propagation Time-conscious Influence Maximization

Hui Li, Sourav S Bhowmick, Jiangtao Cui +1

The influence maximization (IM) problem as defined in the seminal paper by Kempe et al. has received widespread attention from various research communities, leading to the design o…