806 search results - page 27 / 162 » Lower Bounds on Correction Networks |
166
click to vote
AAAI
2008
15 years 8 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
168
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
143
click to vote
INFOCOM
1995
IEEE
15 years 9 months ago
1995
IEEE
Many network applications that require Quality-ofService QoS support, such as transmission of digital voice and video, tolerate a certain level of service degradation. In this s...
182
click to vote
TIT
2011
15 years 1 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...
169
click to vote
UAI
1997
15 years 7 months ago
1997
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...