Sciweavers

4255 search results - page 107 / 851
» Cover
Sort
View
122
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 9 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
101
Voted
DAM
2011
14 years 9 months ago
1-factor covers of regular graphs
sarah-marie belcastro, Michael Young
103
Voted
JIDM
2010
73views more  JIDM 2010»
14 years 9 months ago
Cover and Frontmatter
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 6 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
210
Voted
ICITS
2011
14 years 6 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt