Sciweavers

99 search results - page 4 / 20
» New strong direct product results in communication complexit...
Sort
View
FOCS
2003
IEEE
14 years 1 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
CIKM
2010
Springer
13 years 6 months ago
Predicting product adoption in large-scale social networks
Online social networks offer opportunities to analyze user behavior and social connectivity and leverage resulting insights for effective online advertising. We study the adopti...
Rushi Bhatt, Vineet Chaoji, Rajesh Parekh
ADHOC
2010
173views more  ADHOC 2010»
13 years 4 months ago
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors wit...
Harish Sethu, Thomas Gerety
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 9 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 9 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen