3 accepted papers
The maximally diverse grouping problem (MDGP) seeks to partition the vertices of a complete graph into a fixed number of groups under capacity constraints, maximizing the sum of edge weights within each group. MDGP is an NP-hard combinatorial optimization problem and has wide real-world applications
The clique partitioning problem (CPP) aims to find a partition of vertices of a complete graph in order to maximize the sum of edge weights within each partition (clique), which has been proven to be NP-hard and has wide real-world applications. In this paper, we propose an elite-guided weighted sim…
In this work, we propose a learning-based variational network (VN) approach for reconstruction of low-dose 3D computed tomography data. We focus on two methods to decrease the radiation dose: (1) x-ray tube current reduction, which reduces the signal-to-noise ratio, and (2) x-ray beam interruption,…