46 search results - page 1 / 10 » A Discovery Algorithm for Directed Cyclic Graphs |
UAI
1996
13 years 6 months ago
1996
UAI
2008
13 years 6 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
CATS
2006
13 years 6 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
DSD
2010
IEEE
13 years 5 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...