Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maowen Li

dblp:211/5790 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 60% Edge and fog computing · 40%
Artificial intelligence
1 paper
Efficient and distributed learning · 50% Deep learning architectures and training · 50%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › edge inference
collaborative inference
1.012026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Edge and fog computing
mobile edge computing
1.012026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Network optimization and economics
pricing
1.012026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Network optimization and economics
resource allocation
1.012026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Network optimization and economics › game theory › dynamic game
stackelberg game
1.012026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Machine learning › Deep learning architectures and training › convolutional neural network
CNN inference
0.312026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning
distributed inference
0.312026
Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

stackelberg game · 2.0convex optimization · 2.0approximation algorithm · 2.0
YearPublicationVenuePosition
2026 Joint Optimization of Resource and Pricing for Collaborative CNN Inference in Edge Computing
abstract
Convolutional Neural Networks (CNN) have been widely adopted in multi-access edge computing system due to their powerful feature extraction and high inference accuracy. Harnessing the heterogeneous computational capacities of end de vices and edge servers, end-edge collaborative inference addresses resource constraints of end devices and latency challenges of real time inference. However, existing studies typically assume that all potential inference models are pre-employed on the server, which may not always align with real-world deployment scenarios. Moreover, the economic incentives of edge service providers are often overlooked in current distributed inference research. To address these issues, we propose an end-edge collaborative inference framework for CNN in multi-access edge computing system, named DisCNN. We first model the interaction between latency-sensitive end devices (EDs) and resource-constrained edge service providers as a Stackelberg game and prove the existence of a Subgame Perfect Equilibrium. Next, we derive the optimal response characteristics of the EDs and develop an efficient algorithm to allocate computation and communication resources to EDs while partitioning the CNN accordingly. To compute the optimal offloading set, we introduce a linear-time algorithm with a bounded approximation ratio. Then, to jointly optimize caching, resource allocation, and pricing, we design an efficient approximate algorithm to compute a near-optimal solution. Finally, extensive simulation results validate the effectiveness of the proposed framework.
Maowen Li, Xiaolong Xu 0001, Guangming Cui, Yong Cheng 0002, Fei Dai 0002, Wan-Chun Dou, Lianyong Qi, Zhipeng Cai 0001
IEEE Trans. Mob. Comput.1
2017 An Efficient and Robust Visual Tracking via Color-Based Context Prior Model
Chun-lei Yu, Baojun Zhao, Zengshuo Zhang, Maowen Li
ICIG (1)4