777 search results - page 34 / 156 » A fast algorithm for the computation of an upper bound on th... |
MASCOTS
2007
13 years 9 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
UAI
2008
13 years 9 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
JCSS
2008
13 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...