Sciweavers

9 search results - page 2 / 2
» Concentration inequalities for functions of independent vari...
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 7 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 6 months ago
A multivariate generalization of Costa's entropy power inequality
A simple multivariate version of Costa's entropy power inequality is proved. In particular, it is shown that if independent white Gaussian noise is added to an arbitrary multi...
Miquel Payaró, Daniel Pérez Palomar
ESEM
2010
ACM
13 years 4 months ago
Introducing the evaluation of complexity in functional size measurement: a UML-based approach
Functional Size Measures are often used for effort estimation. However, these measures do not take into account the amount and complexity of elaboration required, concentrating in...
Luigi Lavazza, Gabriela Robiolo
PROMISE
2010
13 years 1 months ago
The role of the measure of functional complexity in effort estimation
Background. Currently there are several definitions of measures that should represent the size of software functional requirements. These measures have gained a quite relevant rol...
Luigi Lavazza, Gabriela Robiolo