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...
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
—With the popularity of voting systems in cyberspace, there are growing evidence that the current voting systems can be manipulated by fake votes. This problem has attracted many...
Qinyuan Feng, Yan Lindsay Sun, Ling Liu, Yafei Yan...
The penetration of cellular networks worldwide and emergence of smart phones has led to a revolution in mobile content. Users consume diverse content when, for example, exchanging...
Machigar Ongtang, Kevin R. B. Butler, Patrick Drew...
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...