Sciweavers

13214 search results - page 82 / 2643
» Pseudorandomness for network algorithms
Sort
View
SOFSEM
1997
Springer
15 years 10 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ISNN
2010
Springer
15 years 4 months ago
Pruning Training Samples Using a Supervised Clustering Algorithm
As practical pattern classification tasks are often very-large scale and serious imbalance such as patent classification, using traditional pattern classification techniques in ...
Minzhang Huang, Hai Zhao, Bao-Liang Lu
SPAA
2003
ACM
15 years 11 months ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
BERTINORO
2005
Springer
15 years 12 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
MOBIHOC
2008
ACM
16 years 6 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...