Sciweavers

686 search results - page 88 / 138
» Packing Cycles in Graphs
Sort
View
198
Voted
UAI
2008
15 years 7 months ago
Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
Tamir Hazan, Amnon Shashua
188
Voted
DBSEC
2008
152views Database» more  DBSEC 2008»
15 years 7 months ago
An Attack Graph-Based Probabilistic Security Metric
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
Lingyu Wang, Tania Islam, Tao Long, Anoop Singhal,...
RSA
2006
66views more  RSA 2006»
15 years 6 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
DM
2006
134views more  DM 2006»
15 years 6 months ago
Simultaneous graph parameters: Factor domination and factor total domination
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
Peter Dankelmann, Michael A. Henning, Wayne Goddar...
ENDM
2007
73views more  ENDM 2007»
15 years 6 months ago
Two New Classes of Hamiltonian Graphs: (Extended Abstract)
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...