2125 search results - page 210 / 425 » On Graph Complexity |
176
click to vote
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...
115
click to vote
ICPP
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
189
click to vote
CVPR
2009
IEEE
16 years 10 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
...
156
click to vote
SAC
2011
ACM
14 years 6 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
131
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...