Sciweavers

394 search results - page 35 / 79
» Testing subgraphs in large graphs
Sort
View
CSR
2008
Springer
13 years 10 months ago
Comparing Universal Covers in Polynomial Time
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...
Jirí Fiala, Daniël Paulusma
CVPR
2008
IEEE
13 years 9 months ago
Video segmentation: Propagation, validation and aggregation of a preceding graph
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...
Siying Liu, Dong Guo, Chye Hwang Yan, Sim Heng Ong
COLT
2004
Springer
14 years 2 months ago
Regularization and Semi-supervised Learning on Large Graphs
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...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
FORTE
1998
13 years 10 months ago
Issues in conformance testing: multiple semicontrollable interfaces
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...
Mariusz A. Fecko, M. Ümit Uyar, Adarshpal S. ...
EVOW
2005
Springer
14 years 2 months ago
Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic
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 ...
Abraham Duarte, Ángel Sánchez, Felip...