Sciweavers

80 search results - page 2 / 16
» Interpolating between bounds on the independence number
Sort
View
INFOCOM
2002
IEEE
13 years 10 months ago
Fast PDA Synchronization Using Characteristic Polynomial Interpolation
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
Ari Trachtenberg, David Starobinski, Sachin Agarwa...
PROPERTYTESTING
2010
13 years 3 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
MOBICOM
2005
ACM
13 years 11 months ago
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
— This paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channe...
Pradeep Kyasanur, Nitin H. Vaidya
FOCS
1990
IEEE
13 years 9 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
13 years 12 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao