1461 search results - page 187 / 293 » Complexity of Graph Covering Problems |
108
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
182
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
DAC
2002
ACM
16 years 3 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
114
click to vote
ISCAPDCS
2007
15 years 3 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
171
Voted
STACS
2012
Springer
13 years 10 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...