2924 search results - page 411 / 585 » Lower Bounds in Distributed Computing |
125
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
155
click to vote
PPOPP
1999
ACM
15 years 9 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
153
click to vote
WCNC
2010
IEEE
15 years 8 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
143
click to vote
ICPP
1991
IEEE
15 years 8 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
147
Voted
NCA
2002
IEEE
15 years 4 months ago
2002
IEEE
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...