71 search results - page 5 / 15 » Decomposition Techniques for Subgraph Matching |
BMCBI
2008
13 years 8 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
DMSN
2004
ACM
14 years 1 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
VLSID
2008
IEEE
14 years 8 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
SIGMOD
2010
ACM
13 years 6 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...