Sciweavers

481 search results - page 45 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
MOBIHOC
2010
ACM
13 years 6 months ago
Spectrum pricing games with bandwidth uncertainty and spatial reuse in cognitive radio networks
In cognitive radio networks (CRN), primary users can lease out their unused bandwidth to secondary users in return for a fee. We study price competition in a CRN with multiple pri...
Gaurav S. Kasbekar, Saswati Sarkar
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 9 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 8 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
SIROCCO
2007
13 years 10 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...