Sciweavers

174 search results - page 4 / 35
» Monotonicity in Calculational Proofs
Sort
View
CORR
2006
Springer
77views Education» more  CORR 2006»
13 years 7 months ago
Generalized Entropy Power Inequalities and Monotonicity Properties of Information
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
Mokshay M. Madiman, Andrew R. Barron
ENGL
2007
123views more  ENGL 2007»
13 years 7 months ago
Characterization by Regulated Grammars of Calculations in the Gentzen System G
— The aim of the present work is to present a characterization of the Gentzen System G by means of a regulated grammar, according to the Formal Languages Theory. Given a proposit...
Ruben Monjaraz Hernandez-Imbert, Jose de Jesus Lav...
COMPUTING
2007
78views more  COMPUTING 2007»
13 years 7 months ago
Calculating lower bounds for caching problems
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
Leah Epstein, Rob van Stee
FOCS
1998
IEEE
13 years 11 months ago
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
RTA
1993
Springer
13 years 11 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell