296 search results - page 32 / 60 » Bipartite Graphs as Models of Complex Networks |
106
click to vote
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
125
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
SIGSOFT
2007
ACM
16 years 16 days ago
2007
ACM
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...