1729 search results - page 264 / 346 » Bound Graph Polysemy |
154
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
147
click to vote
COMBINATORICA
2008
15 years 5 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
147
Voted
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
120
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
142
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...