3809 search results - page 450 / 762 » Randomized Broadcast in Networks |
160
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we develop an intergraded model for request mechanism and data transmission in the uplink phase in the presence of channel noise. This model supports quality of serv...
162
click to vote
NN
2008
Springer
15 years 6 months ago
2008
Springer
MIIND (Multiple Interacting Instantiations of Neural Dynamics) is a highly modular multi-level C++ framework, that aims to shorten the development time for models in Cognitive Neu...
166
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
186
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we consider the design of synchronization-aware distributed space-time codes, which we denote as diagonal distributed space-time codes (DDSTC), for N relay nodes...