74 search results - page 14 / 15 » The Lower Tail of the Random Minimum Spanning Tree |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
MOBIHOC
2007
ACM
14 years 5 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...
BMVC
2010
13 years 3 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
ISPA
2007
Springer
13 years 12 months ago
2007
Springer
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...