Sciweavers

5624 search results - page 208 / 1125
» On Conditional Covering Problem
Sort
View
FLAIRS
2007
15 years 9 months ago
Lossless Decomposition of Bayesian Networks
In this paper, we study the problem of information preservation when decomposing a single Bayesian network into a set of smaller Bayesian networks. We present a method that lossle...
Dan Wu
DM
2006
54views more  DM 2006»
15 years 6 months ago
A note on interconnecting matchings in graphs
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Tomás Kaiser
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler
FSTTCS
2004
Springer
15 years 12 months ago
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
SIAMCO
2008
81views more  SIAMCO 2008»
15 years 6 months ago
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
Ming Cao, A. Stephen Morse, Brian D. O. Anderson