Sciweavers

3105 search results - page 257 / 621
» The Path-Packing Structure of Graphs
Sort
View
ACSD
2004
IEEE
113views Hardware» more  ACSD 2004»
15 years 7 months ago
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
15 years 7 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
149
Voted
AAAI
2008
15 years 6 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
USS
2008
15 years 6 months ago
Securing Provenance
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
Uri Braun, Avraham Shinnar, Margo I. Seltzer
141
Voted
LREC
2010
197views Education» more  LREC 2010»
15 years 5 months ago
Automatic Annotation of Co-Occurrence Relations
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
Dirk Goldhahn, Uwe Quasthoff