Sciweavers

911 search results - page 21 / 183
» Kolmogorov Complexity Cores
Sort
View
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 2 months ago
On Query Algebras for Probabilistic Databases
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
Christoph Koch
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 5 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
ICMCS
2005
IEEE
70views Multimedia» more  ICMCS 2005»
15 years 7 months ago
A Multimodal Complexity Comprehension-Time Framework for Automated Presentation Synthesis
In this paper, we present a joint multimodal (audio, visual and text) framework to map the informational complexity of the media elements to comprehension time. The problem is imp...
Harini Sridharan, Aankus Mani, Hari Sundaram
TIT
2010
122views Education» more  TIT 2010»
14 years 8 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 2 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...