Quality-Utility Link: A Framework for Trustworthy LLM-Generated Data in E-Waste Recycling Paper Info Title Quality-Utility Link: A Framework for Trustworthy LLM-Generated Data in E-Waste Recycling Authors Liang Cheng, Amir Taherkardi, Martin Giese, Golnoush Abbasi Conference 2026-08-01 Research LLM E-Waste Data Synthesis Quality Assessment WEEE KSEM
Enabling Edge Intelligence through Variational Autoencoder-Based Model Compression Paper Info Title Enabling Edge Intelligence through Variational Autoencoder-Based Model Compression Authors Liang Cheng, Peiyuan Guan, Amir Taherkordi, Dapeng Lan Conference IEEE 11th In 2025-07-18 Research Model Compression Variational Autoencoder Edge Computing Deep Learning IEEE EdgeCom
Transfer Learning-Assisted Inverse Modeling in Nanophotonics Based on Mixture Density Networks Paper Info Title Transfer Learning-Assisted Inverse Modeling in Nanophotonics Based on Mixture Density Networks Authors Liang Cheng, Prashant Singh, Francesco Ferranti Journal IEEE Acces 2024-04-02 Research Nanophotonics Mixture Density Network Transfer Learning Inverse Design IEEE Access
Uncovering the Handwritten Text in the Margins: End-to-end Handwritten Text Detection and Recognition Paper Info Title Uncovering the Handwritten Text in the Margins: End-to-end Handwritten Text Detection and Recognition Authors Liang Cheng, Jonas Frankemölle, Adam Axelsson, Ekta Vats Co 2024-03-22 Research Handwritten Text Recognition Marginalia Faster R-CNN AttentionHTR Digital Humanities
Autoencoder-Based Likelihood-Free Parameter Inference of Gene Regulatory Network Paper Info Title Autoencoder-Based Likelihood-Free Parameter Inference of Gene Regulatory Network Author Liang Cheng Master Thesis DiVA: diva2:1777819 Code GitHub: autoencoder-as-summa 2023-06-15 Research Likelihood-Free Inference Autoencoder Gene Regulatory Network Summary Statistics SNPE
Alpha-Beta Pruning Alpha-Beta pruning is a search algorithm used to reduce the number of nodes in a minimax search tree. When the algorithm evaluates that the subsequent moves of a strategy are worse than those of the p 2022-10-09 Blog Artificial Intelligence
Breadth-First Search and Depth-First Search Breadth-First Search (BFS) and Depth-First Search (DFS) are two ways of traversing all vertices in a graph. These two basic search algorithms are introduced below. Breadth-First Search • Idea behind 2022-09-11 Blog Artificial Intelligence
Linear Regression Linear regression assumes that features and outcomes satisfy a linear relationship. The expressive ability of linear relationship is strong. The influence of each feature on the result can be reflecte 2022-08-13 Blog Machine Learning
Computation of Eigenvalues and Eigenvectors For a small matrix AAA, we usually compute its eigenvalues through det(A−λI)det(A-\lambda I)det(A−λI). But in reality, this computation is too expensive for most matrices. And in many cases, we only n 2022-07-12 Blog Linear Algebra
Principal Component Analysis (PCA) Principal Component Analysis is a technique for simplifying datasets. It is a linear transformation that transforms the data into a new coordinate system such that the first largest variance of any da 2022-07-11 Blog Linear Algebra
