Sciweavers

3238 search results - page 630 / 648
» Not Enough Points Is Enough
Sort
View
TCS
2010
13 years 6 months ago
Clustering with partial information
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...
TKDE
2010
153views more  TKDE 2010»
13 years 6 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
TKDE
2010
158views more  TKDE 2010»
13 years 6 months ago
Voting Systems with Trust Mechanisms in Cyberspace: Vulnerabilities and Defenses
—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...
ACSAC
2010
IEEE
13 years 5 months ago
Porscha: policy oriented secure content handling in Android
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...
FOCS
2010
IEEE
13 years 5 months ago
The Coin Problem and Pseudorandomness for Branching Programs
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...
Joshua Brody, Elad Verbin