684 search results - page 58 / 137 » A characterization of b-perfect graphs |
147
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
137
click to vote
ISBI
2009
IEEE
15 years 8 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
99
Voted
FOCS
1994
IEEE
15 years 6 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
132
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...