Sciweavers

6437 search results - page 834 / 1288
» Parallel Algorithms for Arrangements
Sort
View
PODC
2009
ACM
16 years 7 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
PODC
2009
ACM
16 years 7 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
GCC
2007
Springer
16 years 1 months ago
Telemeter: Network Distance Prediction Base on Network Topology
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
Lin Cong, Yang Chen, Xiaohui Shi, Ye Wang, Weiyu W...
PODC
2005
ACM
16 years 13 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SPAA
2005
ACM
16 years 13 days ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner