11217 search results - page 473 / 2244 » Network Coding for Wireless Networks |
222
click to vote
OL
2011
15 years 1 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
308
click to vote
NN
2011
Springer
15 years 1 months ago
2011
Springer
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
144
click to vote
TIT
2008
15 years 6 months ago
2008
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
201
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...