1127 search results - page 122 / 226 » Testing the Expansion of a Graph |
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
SSDBM
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
ACMSE
2005
ACM
15 years 3 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified ...