Sciweavers

2588 search results - page 11 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
IFIPTCS
2000
15 years 2 months ago
List Decoding: Algorithms and Applications
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
Madhu Sudan
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 11 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 1 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DLT
2003
15 years 17 days ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
WSC
2004
15 years 16 days ago
A Generalized Multiple Response Surface Methodology for Complex Computer Simulation Applications
This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...
Jeffrey B. Schamburg, Donald E. Brown