522 search results - page 30 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
194
Voted
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
142
click to vote
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
123
click to vote
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
105
click to vote
IFIPTCS
2010
15 years 25 days ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
128
click to vote
DBSEC
2009
15 years 4 months ago
2009
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...