2680 search results - page 168 / 536 » The topology of the independence complex |
108
click to vote
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
120
click to vote
AUTOMATICA
2011
14 years 8 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Spectral voice conversion is usually performed using a single model selected in order to represent a tradeoff between goodness of fit and complexity. Recently, we proposed a new ...
HPCA
2009
IEEE
16 years 1 months ago
2009
IEEE
Interconnection plays an important role in performance and power of CMP designs using deep sub-micron technology. The network-on-chip (NoCs) has been proposed as a scalable and hi...
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increa...