Sciweavers

3958 search results - page 592 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
SPIN
2010
Springer
15 years 4 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
ARC
2010
Springer
126views Hardware» more  ARC 2010»
15 years 4 months ago
Reconfigurable Communication Networks in a Parametric SIMD Parallel System on Chip
The SIMD parallel systems play a crucial role in the field of intensive signal processing. For most the parallel systems, communication networks are considered as one of the challe...
Mouna Baklouti, Philippe Marquet, Jean-Luc Dekeyse...
SOCIALCOM
2010
15 years 4 months ago
A Scalable Framework for Modeling Competitive Diffusion in Social Networks
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
Matthias Broecheler, Paulo Shakarian, V. S. Subrah...
ATAL
2008
Springer
15 years 8 months ago
Resource limitations, transmission costs and critical thresholds in scale-free networks
Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001...
Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng,...