Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
Fuzzy relations on the same domain are classified according to the equality of families of cut sets. This equality of fuzzy relations is completely characterized, not only for un...
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
We present a new intuitive UI, which we call cross-boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our sy...