2531 search results - page 44 / 507 » Group testing in graphs |
92
Voted
EJC
2006
15 years 20 days ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
85
Voted
EJC
2006
15 years 20 days ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
126
click to vote
DSD
2003
IEEE
15 years 6 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
145
click to vote
ANTSW
2004
Springer
15 years 4 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
108
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...