activity
20082023
most citedOnline Robust Subspace Tracking from Partial Information

101 citations · 451 across the 77 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

cs.NI2017★ 3 cited

Joint Cache Resource Allocation and Request Routing for In-network Caching Services

Weibo Chu, Mostafa Dehghan, John C. S. Lui +2

In-network caching is recognized as an effective solution to offload content servers and the network. A cache service provider (SP) always has incentives to better utilize its cach…

cs.DC2017★ 16 cited

G-thinker: Big Graph Mining Made Easier and Faster

Da Yan, Hongzhi Chen, James Cheng +3

This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and c…

cs.LG2017

Multi-level Feedback Web Links Selection Problem: Learning and Optimization

Kechao Cai, Kun Chen, Longbo Huang +1

Selecting the right web links for a website is important because appropriate links not only can provide high attractiveness but can also increase the website's revenue. In this wor…

cs.SI2017

Tracking Triadic Cardinality Distributions for Burst Detection in High-Speed Multigraph Streams

Junzhou Zhao, Pinghui Wang, John C. S. Lui +2

In everyday life, we often observe unusually frequent interactions among people before or during important events, e.g., people send/receive more greetings to/from their friends on…

cs.SI2017★ 1 cited

Sampling Online Social Networks by Random Walk with Indirect Jumps

Junzhou Zhao, Pinghui Wang, John C. S. Lui +2

Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph i…

cs.SI2017

Optimizing Node Discovery on Networks: Problem Definitions, Fast Algorithms, and Observations

Junzhou Zhao, Pinghui Wang, John C. S. Lui

Many people dream to become famous, YouTube video makers also wish their videos to have a large audience, and product retailers always hope to expose their products to customers as…