1547 search results - page 24 / 310 » Randomized Variable Elimination |
TCOM
2010
14 years 4 months ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
IFIPTM
2009
14 years 7 months ago
2009
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
69
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
100
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
84
Voted
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a new method for calculating a tight approximation to the distribution of the sum of independent lognormal random variables. We make use of a three