Sciweavers

5140 search results - page 68 / 1028
» Complex Network of Earthquakes
Sort
View
137
Voted
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 7 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
147
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang ...
151
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...
INFOCOM
2007
IEEE
15 years 10 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
129
Voted
WIOPT
2010
IEEE
15 years 2 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos