870 search results - page 36 / 174 » Graph Comparison Using Fine Structure Analysis |
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
CC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
143
click to vote
BMCBI
2010
14 years 7 months ago
2010
Background: Genomewide association studies have resulted in a great many genomic regions that are likely to harbor disease genes. Thorough interrogation of these specific regions ...
SCIA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...