1145 search results - page 24 / 229 » Discrete Green's Functions |
JMLR
2002
14 years 9 months ago
2002
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
ISIPTA
2003
IEEE
15 years 2 months ago
2003
IEEE
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
66
Voted
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...