Sciweavers

806 search results - page 27 / 162
» Lower Bounds on Correction Networks
Sort
View
AAAI
2008
14 years 11 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 9 months ago
Testing Triangle-Freeness in General Graphs
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...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
INFOCOM
1995
IEEE
15 years 1 months ago
A Service with Bounded Degradation in Quality-of-Service Networks
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...
Jörg Liebeherr, Dongwei Liao
TIT
2011
149views more  TIT 2011»
14 years 4 months ago
Network Coding for Computing: Cut-Set Bounds
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...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
UAI
1997
14 years 10 months ago
Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions
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...
Fabio Gagliardi Cozman