Sciweavers

10 search results - page 2 / 2
» Inequalities for Shannon Entropy and Kolmogorov Complexity
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 5 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 5 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
INFORMATICALT
2010
142views more  INFORMATICALT 2010»
13 years 3 months ago
Complexity Estimation of Genetic Sequences Using Information-Theoretic and Frequency Analysis Methods
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...
Robertas Damasevicius
MFCS
2010
Springer
13 years 3 months ago
Information Complexity of Online Problems
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
Juraj Hromkovic, Rastislav Královic, Richar...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 5 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...