5592 search results - page 712 / 1119 » On Random Betweenness Constraints |
207
click to vote
MOBIHOC
2008
ACM
16 years 7 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
295
click to vote
MOBIHOC
2007
ACM
16 years 7 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
268
click to vote
MOBIHOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
209
click to vote
MOBIHOC
2003
ACM
16 years 7 months ago
2003
ACM
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...
164
click to vote
COCOON
2009
Springer
16 years 2 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...