394 search results - page 35 / 79 » Testing subgraphs in large graphs |
130
Voted
CSR
2008
Springer
15 years 6 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
173
click to vote
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this work, video segmentation is viewed as an efficient intra-frame grouping temporally reinforced by a strong inter-frame coherence. Traditional approaches simply regard pixel...
125
Voted
COLT
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
116
Voted
FORTE
1998
15 years 6 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
142
click to vote
EVOW
2005
Springer
15 years 10 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 ...