Sciweavers

29908 search results - page 136 / 5982
» On the complexity of communication complexity
Sort
View
JGAA
2002
74views more  JGAA 2002»
14 years 9 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez
AUTOMATICA
2011
14 years 5 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
15 years 4 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
CISSE
2008
Springer
14 years 11 months ago
Network Topology Impact on Influence Spreading
-- Networks composed of large number of nodes interacting in structured ways such as power grids, communication networks, social networks or market networks are critical port of th...
Sasho Gramatikov, Dimitar Trajanov, Ljupco Kocarev...