Sciweavers

838 search results - page 11 / 168
» On the Robustness of Complex Networks by Using the Algebraic...
Sort
View
ECCC
2008
168views more  ECCC 2008»
13 years 7 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
JSC
2010
96views more  JSC 2010»
13 years 6 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
IWCMC
2006
ACM
14 years 1 months ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
GLOBECOM
2010
IEEE
13 years 5 months ago
Interference-Aware Robust Wireless Mesh Network Design
Interference has been proven to have an effect on the performance in wireless mesh networks (WMN). Using multichannels can improve the performance of WMNs by reducing interference ...
Farah Kandah, Weiyi Zhang, Yashaswi Singh, Juan Li
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 9 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...