Sciweavers

1169 search results - page 9 / 234
» Degrees of monotone complexity
Sort
View
ADCM
2007
104views more  ADCM 2007»
13 years 7 months ago
Shape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
Paolo Costantini, Francesca Pelosi
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
14 years 7 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
ASP
2001
Springer
13 years 12 months ago
Genes and Ants for Default Logic
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
Pascal Nicolas, Frédéric Saubion, Ig...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 2 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
JCSS
2006
77views more  JCSS 2006»
13 years 7 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter