365 citations · 365 across the 3 of their papers we have counts for
7 papers
Efficiently Finding a Maximal Clique Summary via Effective Sampling
Xiaofan Li, Rui Zhou, Lu Chen +3
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and is used in many applications, such as social network analysis, bioinformatics, intelligent agent syste…
An Android Application Risk Evaluation Framework Based on Minimum Permission Set Identification
Jianmao Xiao, Shizhan Chen, Qiang He +2
Android utilizes a security mechanism that requires apps to request permission for accessing sensitive user data, e.g., contacts and SMSs, or certain system features, e.g., camera…
Cutting the Unnecessary Long Tail: Cost-Effective Big Data Clustering in the Cloud
Dongwei Li, Shuliang Wang, Nan Gao +2
Clustering big data often requires tremendous computational resources where cloud computing is undoubtedly one of the promising solutions. However, the computation cost in the clou…
Edge User Allocation with Dynamic Quality of Service
Phu Lai, Qiang He, Guangming Cui +6
In edge computing, edge servers are placed in close proximity to end-users. App vendors can deploy their services on edge servers to reduce network latency experienced by their app…
Optimal Edge User Allocation in Edge Computing with Variable Sized Vector Bin Packing
Phu Lai, Qiang He, Mohamed Abdelrazek +4
In mobile edge computing, edge servers are geographically distributed around base stations placed near end-users to provide highly accessible and efficient computing capacities and…
Service Capacity Enhanced Task Offloading and Resource Allocation in Multi-Server Edge Computing Environment
Wei Du, Tao Lei, Qiang He +4
An edge computing environment features multiple edge servers and multiple service clients. In this environment, mobile service providers can offload client-side computation tasks f…