1 citations · 2 across the 7 of their papers we have counts for
7 papers
SoberDSE: Sample-Efficient Design Space Exploration via Learning-Based Algorithm Selection
Lei Xu, Shanshan Wang, Chenglong Xiao
High-Level Synthesis (HLS) is a pivotal electronic design automation (EDA) technology that enables the generation of hardware circuits from high-level language descriptions. A crit…
MPM-LLM4DSE: Reaching the Pareto Frontier in HLS with Multimodal Learning and LLM-Driven Exploration
Lei Xu, Shanshan Wang, Chenglong Xiao
High-Level Synthesis (HLS) design space exploration (DSE) seeks Pareto-optimal designs within expansive pragma configuration spaces. To accelerate HLS DSE, graph neural networks (G…
Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture
Xiang Li, Shanshan Wang, Chenglong Xiao
Although the Maximum Clique Problem (MCP) has been extensively studied and features a rich ecosystem of exact solvers, empirical evidence shows that solver performance varies subst…
Intelligent4DSE: Optimizing High-Level Synthesis Design Space Exploration with Graph Neural Networks and Large Language Models
Lei Xu, Shanshan Wang, Emmanuel Casseau +1
High-Level Synthesis (HLS) Design Space Exploration (DSE) is essential for generating hardware designs that balance performance, power, and area (PPA). To optimize this process, ex…
An algorithm with a delay of for enumerating connected induced subgraphs of size
Chenglong Xiao, Chengyong Mao, Shanshan Wang
The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this paper, we propose an algorithm with a delay of $O(kΔ…
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
Shanshan Wang, Chenglong Xiao, Emmanuel Casseau
The problem of enumerating all connected induced subgraphs of a given order from a given graph arises in many practical applications: bioinformatics, information retrieval, pro…
Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
Shanshan Wang, Chenglong Xiao
Mining subgraphs with interesting structural properties from networks (or graphs) is a computationally challenging task. In this paper, we propose two algorithms for enumerating al…