Sciweavers

2084 search results - page 128 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 7 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
ICDCS
2008
IEEE
15 years 11 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
INFOCOM
2008
IEEE
15 years 11 months ago
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
Yi Shi, Y. Thomas Hou
146
Voted
WOSP
2005
ACM
15 years 10 months ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
ICASSP
2009
IEEE
15 years 11 months ago
A mixed time-scale algorithm for distributed parameter estimation : Nonlinear observation models and imperfect communication
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
Soummya Kar, José M. F. Moura