Sciweavers

1153 search results - page 133 / 231
» Reversing graph transformations
Sort
View
101
Voted
JSAT
2006
87views more  JSAT 2006»
15 years 18 days ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
98
Voted
ACL
2010
14 years 10 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
IPMU
2010
Springer
14 years 10 months ago
Possibilistic Graphical Models and Compositional Models
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
Jirina Vejnarová
199
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 3 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
100
Voted
FASE
2009
Springer
15 years 4 months ago
Object Flow Definition for Refined Activity Diagrams
Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we ref...
Stefan Jurack, Leen Lambers, Katharina Mehner, Gab...