Yongli Cheng

Orcid: 0000-0002-5250-9437

According to our database1, Yongli Cheng authored at least 23 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A disk I/O optimized system for concurrent graph processing jobs.
Frontiers Comput. Sci., June, 2024

TgStore: An Efficient Storage System for Large Time-Evolving Graphs.
IEEE Trans. Big Data, April, 2024

An efficient SSSP algorithm on time-evolving graphs with prediction of computation results.
J. Parallel Distributed Comput., April, 2024

2023
FPC-Net: Learning to detect face forgery by adaptive feature fusion of patch correlation with CG-Loss.
IET Comput. Vis., April, 2023

LOSC: A locality-optimized subgraph construction scheme for out-of-core graph processing.
J. Parallel Distributed Comput., February, 2023

Deep Metric Multi-View Hashing for Multimedia Retrieval.
Proceedings of the IEEE International Conference on Multimedia and Expo, 2023

2022
GraphSD: A State and Dependency aware Out-of-Core Graph Processing System.
Proceedings of the 51st International Conference on Parallel Processing, 2022

2021
CIC-PIM: Trading spare computing power for memory space in graph processing.
J. Parallel Distributed Comput., 2021

GraphCP: An I/O-Efficient Concurrent Graph Processing Framework.
Proceedings of the 29th IEEE/ACM International Symposium on Quality of Service, 2021

IBFM: An Instance-weight Balanced Factorization Machine for Sparse Prediction.
Proceedings of the 2021 International Conference on Data Mining, 2021

MatchMaker: Aspect-Based Sentiment Classification via Mutual Information.
Proceedings of the Neural Information Processing - 28th International Conference, 2021

2020
A Hybrid Update Strategy for I/O-Efficient Out-of-Core Graph Processing.
IEEE Trans. Parallel Distributed Syst., 2020

2019
Using High-Bandwidth Networks Efficiently for Fast Graph Computation.
IEEE Trans. Parallel Distributed Syst., 2019

LOSC: efficient out-of-core graph processing with locality-optimized subgraph construction.
Proceedings of the International Symposium on Quality of Service, 2019

2018
A highly cost-effective task scheduling strategy for very large graph computation.
Future Gener. Comput. Syst., 2018

A communication-reduced and computation-balanced framework for fast graph computation.
Frontiers Comput. Sci., 2018

HUS-Graph: I/O-Efficient Out-of-Core Graph Processing with Hybrid Update Strategy.
Proceedings of the 47th International Conference on Parallel Processing, 2018

2017
Efficient Anonymous Communication in SDN-Based Data Center Networks.
IEEE/ACM Trans. Netw., 2017

BlitzG: Exploiting high-bandwidth networks for fast graph processing.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016
LCC-Graph: A high-performance graph-processing framework with low communication costs.
Proceedings of the 24th IEEE/ACM International Symposium on Quality of Service, 2016

DD-Graph: A Highly Cost-Effective Distributed Disk-based Graph-Processing Framework.
Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, 2016

2014
Distributed observer design for bounded tracking control of leader-follower multi-agent systems in a sampled-data setting.
Int. J. Control, 2014

2013
Consensus of second-order multi-agent systems with a time-varying reference signal via sampled control.
Int. J. Control, 2013


  Loading...