1941 search results - page 108 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
WEA
2005
Springer
15 years 3 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves the theoretical bound on degrees of freedom (DOF) for interference channel systems. Ho...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
SIAMCOMP
2008
14 years 10 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
ICDCN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...