Sciweavers

1545 search results - page 226 / 309
» On tree congestion of graphs
Sort
View
CAV
1999
Springer
104views Hardware» more  CAV 1999»
15 years 2 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
SIGCSE
1998
ACM
107views Education» more  SIGCSE 1998»
15 years 2 months ago
Web-based animation of data structures using JAWAA
JAWAA is a simple command language for creating animations of data structures and displaying them with a Web browser. Commands are stored in a script file that is retrieved and r...
Willard C. Pierson, Susan H. Rodger
IPMU
1994
Springer
15 years 2 months ago
Philosophical Foundations for Causal Networks
Bayes nets are seeing increasing use in expert systems [2, 6], and structural equations models continue to be popular in many branches of the social sciences [1]. Both types of mod...
Glenn Shafer
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
14 years 11 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...