Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju ...
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...