2531 search results - page 150 / 507 » Group testing in graphs |
150
click to vote
NETWORKING
2008
15 years 7 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
159
click to vote
NIPS
2004
15 years 7 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
138
click to vote
JCT
2008
15 years 6 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
197
click to vote
ICDAR
2009
IEEE
15 years 3 months ago
2009
IEEE
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
144
click to vote
IWOCA
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...