Sciweavers

658 search results - page 56 / 132
» Lower bounds for sorting networks
Sort
View
TDSC
2010
157views more  TDSC 2010»
13 years 2 months ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
TCOM
2010
109views more  TCOM 2010»
13 years 6 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
ACAL
2007
Springer
14 years 1 months ago
Structural Circuits and Attractors in Kauffman Networks
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
Kenneth A. Hawick, Heath A. James, Chris Scogings