123 search results - page 5 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
TIT
2011
13 years 2 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
PAKDD
2009
ACM
13 years 12 months ago
2009
ACM
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
MFCS
2004
Springer
14 years 21 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...