Sciweavers

552 search results - page 50 / 111
» Lower bounds for dynamic connectivity
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 9 months ago
Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
Chao Tian, Soheil Mohajer, Suhas N. Diggavi
MOBIHOC
2006
ACM
14 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
SPAA
2010
ACM
14 years 2 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 10 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
PVLDB
2011
13 years 4 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...