2531 search results - page 194 / 507 » Group testing in graphs |
177
click to vote
SIGSOFT
2003
ACM
16 years 7 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...
177
click to vote
SSDBM
2007
IEEE
16 years 21 days 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...
169
click to vote
ACMSE
2005
ACM
15 years 12 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...
166
click to vote
EVOW
2005
Springer
15 years 12 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 ...
149
click to vote
ENTCS
2008
15 years 6 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...