123 search results - page 6 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we focus on the diversity order of the decode-and-forward (DF) cooperative networks with relay selection. Many detection schemes have been proposed for the DF; b...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...