Sciweavers

13603 search results - page 200 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
SCFBM
2008
138views more  SCFBM 2008»
15 years 6 months ago
Epigrass: a tool to study disease spread in complex networks
Background: The construction of complex spatial simulation models such as those used in network epidemiology, is a daunting task due to the large amount of data involved in their ...
Flávio C. Coelho, Oswaldo G. Cruz, Cl&aacut...
CORR
2012
Springer
194views Education» more  CORR 2012»
14 years 2 months ago
A Graph Theoretical Approach to Network Encoding Complexity
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Li Xu, Weiping Shang, Guangyue Han
207
Voted
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 9 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
EVOW
2008
Springer
15 years 8 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim