The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...