We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead of transforming a given graph by a minimum number of edge modifications into a disjoint union of cliques (Cluster Editing), the task in the case of s-Plex Editing is now to transform a graph into a disjoint union of so...

We introduce the s-Plex Cluster Editing problem as a generalization of the wellstudied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead of transforming a given graph by a minimum number of edge modifications into a disjoint union of cliques (this is Cluster Editing), the task in the case of s-Plex Cluster Editing is to transform a grap...

Recent identification of several different types of RNA editing factors in plant organelles suggests complex RNA editosomes within which each factor has a different task. However, the precise protein interactions between the different editing factors are still poorly understood. In this paper, we show that the E+-type pentatricopeptide repeat (PPR) protein SLO2, which lacks a C-terminal cytidin...

paradigm shift in media production: the advent of computational media production that will automate the capture, editing, and reuse of video content. By integrating metadata creation and (re)use throughout the media production process, we’ll enable the mass customization of video. F or the majority of people to not just watch but make video on a daily basis, the current media production process...

Recent research has witnessed advances in facial image editing tasks including face swapping and reenactment. However, these methods are confined to dealing with one specific task at a time. In addition, for video editing, previous either simply apply transformations frame by or utilize multiple frames concatenated iterative fashion, which leads noticeable visual flickers. this paper, we propos...

Matrix visualizations are a useful tool to provide general overview of graph's structure. For multivariate graphs, remaining challenge is cope with the attributes that associated nodes and edges. Addressing this challenge, we propose responsive matrix cells as focus+context approach for embedding additional interactive views into matrix. Responsive local zoomable regions interest auxiliary data...

In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets. From a graph theoretic point of view, a cluster graph is a vertex-disjoint union of cliques. The clustering problem is the task of making fewest changes to the edge set of an input graph so that it becomes a cluster graph. We study the complexity of three variants of the problem. In the C...

Tools for visualizing and creating groundtruth and metadata are crucial for document image analysis research. In this paper we describe TrueViz [LK00, KLCB01], which is a tool for visualizing and editing groundtruth/metadata. We rst describe the groundtruthing task and the requirements for any interactive groundtruthing tool. Next we describe the system design of TrueViz and discuss how a user ...

We consider a challenging clustering task: the clustering of multi-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, we developed a methodology taking as input multi-word terms and lexico-syntactic relations between them. Our clustering algorithm, named CPCL is implemented in the TermWatch system. We compared CPCL to other existing ...