32 search results - page 1 / 7 » A new viewpoint on code generation for directed acyclic grap... |
55
Voted
TODAES
1998
14 years 9 months ago
1998
IADIS
2008
14 years 11 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
BMCBI
2008
14 years 9 months ago
2008
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
86
Voted
GD
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
74
Voted
DAC
1996
ACM
15 years 1 months ago
1996
ACM
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...