Sciweavers

446 search results - page 26 / 90
» On the Interactive Complexity of Graph Reliability
Sort
View
BMCBI
2008
83views more  BMCBI 2008»
13 years 8 months ago
Prioritization of gene regulatory interactions from large-scale modules in yeast
Background: The identification of groups of co-regulated genes and their transcription factors, called transcriptional modules, has been a focus of many studies about biological s...
Ho-Joon Lee, Thomas Manke, Ricardo Bringas, Martin...
COMCOM
2011
13 years 2 months ago
Reconstructing social interactions using an unreliable wireless sensor network
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...
Adrien Friggeri, Guillaume Chelius, Eric Fleury, A...
GLOBECOM
2010
IEEE
13 years 5 months ago
Information Epidemics in Complex Networks with Opportunistic Links and Dynamic Topology
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
Pin-Yu Chen, Kwang-Cheng Chen
IWCMC
2009
ACM
14 years 18 days ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 8 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous