Sciweavers

287 search results - page 21 / 58
» Communication complexity as a lower bound for learning in ga...
Sort
View
MASCOTS
2007
13 years 9 months ago
Stochastic Bounds Applied to the End to End QoS in Communication Systems
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
Hind Castel, Lynda Mokdad, Nihal Pekergin
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
FM
2008
Springer
148views Formal Methods» more  FM 2008»
13 years 9 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
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
TIT
2010
87views Education» more  TIT 2010»
13 years 2 months ago
Silence-based communication
We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of ...
Anand K. Dhulipala, Christina Fragouli, Alon Orlit...