1511 search results - page 137 / 303 » Hierarchical Graph Transformation |
156
Voted
SLP
1997
15 years 8 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
210
Voted
SODA
1997
ACM
15 years 8 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
197
Voted
BMCBI
2006
15 years 7 months ago
2006
Background: Microarray technology produces gene expression data on a genomic scale for an endless variety of organisms and conditions. However, this vast amount of information nee...
178
click to vote
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
195
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...