6 search results - page 1 / 2 » Going Weighted: Parameterized Algorithms for Cluster Editing |
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
BMCBI
2007
13 years 5 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
SIGIR
2011
ACM
12 years 7 months ago
2011
ACM
The majority of the current information retrieval models weight the query concepts (e.g., terms or phrases) in an unsupervised manner, based solely on the collection statistics. I...
WWW
2006
ACM
14 years 5 months ago
2006
ACM
We present GoGetIt!, a tool for generating structure-driven crawlers that requires a minimum effort from the users. The tool takes as input a sample page and an entry point to a W...
TCS
2010
13 years 3 months ago
2010
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...