7 citations · 7 across the 5 of their papers we have counts for
5 papers
Minimizing Makespan in Sublinear Time via Weighted Random Sampling
Bin Fu, Yumei Huo, Hairong Zhao
We consider the classical makespan minimization scheduling problem where jobs must be scheduled on identical machines. Using weighted random sampling, we developed two subl…
Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth
Bin Fu, Yumei Huo, Hairong Zhao
We study the classical scheduling problem on parallel machines %with precedence constraints where the precedence graph has the bounded depth . Our goal is to minimize the maximu…
Streaming Algorithms for Multitasking Scheduling with Shared Processing
Bin Fu, Yumei Huo, Hairong Zhao
In this paper, we design the first streaming algorithms for the problem of multitasking scheduling on parallel machines with shared processing. In one pass, our streaming approxima…
Multitasking Scheduling with Shared Processing
Bin Fu, Yumei Huo, Hairong Zhao
Recently, the problem of multitasking scheduling has attracted a lot of attention in the service industries where workers frequently perform multiple tasks by switching from one ta…
LGAN: Lung Segmentation in CT Scans Using Generative Adversarial Network
Jiaxing Tan, Longlong Jing, Yumei Huo +2
Lung segmentation in computerized tomography (CT) images is an important procedure in various lung disease diagnosis. Most of the current lung segmentation approaches are performed…