Sciweavers

1221 search results - page 201 / 245
» Two Consistency Results on Set Mappings
Sort
View
JCSS
2000
121views more  JCSS 2000»
15 years 5 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
SOFSEM
2012
Springer
14 years 1 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas
ICALP
2009
Springer
16 years 6 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
EDBT
2008
ACM
167views Database» more  EDBT 2008»
16 years 6 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant
AI
2010
Springer
15 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel