1952 search results - page 333 / 391 » Complete partitions of graphs |
135
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
158
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— IEEE 802.11 Wi-Fi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using...
142
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
234
click to vote
SIGAL
1990
15 years 8 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
139
click to vote
JCB
2007
15 years 4 months ago
2007
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...