Sciweavers

1722 search results - page 125 / 345
» On the sample mean of graphs
Sort
View
NIPS
2008
15 years 7 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen
WSC
1997
15 years 7 months ago
The VisSim/Discrete Event Modeling Environment
VisSim/Discrete Event is a process-oriented, discrete event modeling toolkit based on the powerful and proven graphical interface provided by the underlying VisSim simulation envi...
Herbert D. Schwetman, Arun Mulpur
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 6 months ago
Data Reduction in Intrusion Alert Correlation
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...
Gianni Tedesco, Uwe Aickelin
ENDM
2010
101views more  ENDM 2010»
15 years 6 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ENTCS
2007
108views more  ENTCS 2007»
15 years 6 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig