We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Many applications need to segment out all small round
regions in an image. This task of finding dots can be viewed
as a region segmentation problem where the dots form one
regio...
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
Swarming agents often operate in benign geographic topologies that let them explore alternative trajectories with minor variations that the agent dynamics then amplify for improve...
Sven A. Brueckner, Theodore C. Belding, Robert Bis...