Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
To release micro-data tables containing sensitive data, generalization algorithms are usually required for satisfying given privacy properties, such as k-anonymity and l-diversity....
Lei Zhang 0004, Lingyu Wang, Sushil Jajodia, Alexa...
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...