Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Sub-graph Isomorphism"”.
-
Approximate Sub-Graph Isomorphism For Watermarking Finite State Machine Hardware
… can be achieved by matching a directed graph representation of the watermark with a sub-graph in state transition graph representation of the FSM. We experiment with three approaches: a brute force method that provides a proof of concept, a greedy algorithm that provides excellent …
-
On Ranked Approximate Matching Of Large Attributed Graphs
… database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively …
-
From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF)
Resource Description Framework (RDF) is a graph-like data model designed for the web. One of its compelling features is a precise, model-theoretic semantics. We address security in the context of the RDF. We first observe that the problem of securing RDF is related closely to the more traditional …
-
Real-time analytics for complex structure data
… complex relationships are often represented as graphs to denote the content of the data entries and their structural relationships, where instances (nodes) are not only characterized by the content but are also subject to dependency relationships. Plus, real-time availability is one of …
-
Automated application-specific instruction set generation
… first explores the applicationa??s data flow graph and generates all valid custom instruction candidates, subjected to pre-configured resource constraints. Next a custom instruction set is selected using a greedy algorithm, guided by intelligent speedup estimation of each candidate. Finally, …
-
Exhaustive reuse of subquery plans to stretch iterative dynamic programming for complex query optimization
… based on reuse of query plans among similar subqueries. The method generates the cover set of similar subgraphs present in the query graph and allows their corresponding subqueries to share query plans among themselves in the search space. Numerous variants to this scheme have been developed …