Sciweavers

5922 search results - page 282 / 1185
» Navigability of Complex Networks
Sort
View
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...
101
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
132
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
145
Voted
IPPS
1998
IEEE
15 years 8 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
118
Voted
VR
1993
IEEE
15 years 7 months ago
A Virtual World for Network Management
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...
Steven Feiner, Michelle X. Zhou, Laurence A. Crutc...