1153 search results - page 115 / 231 » Reversing graph transformations |
83
Voted
SLP
1997
15 years 2 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...
127
Voted
SODA
1997
ACM
15 years 2 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...
100
Voted
BMCBI
2006
15 years 23 days 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...
93
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
114
Voted
SARA
2009
Springer
15 years 7 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...