777 search results - page 57 / 156 » A fast algorithm for the computation of an upper bound on th... |
JAIR
2011
12 years 10 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
MOBICOM
2005
ACM
14 years 1 months ago
2005
ACM
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
JC
2006
13 years 7 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...