Sciweavers

4616 search results - page 705 / 924
» The Communication Complexity of Correlation
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ICDCS
1991
IEEE
15 years 10 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
MOBICOM
2010
ACM
15 years 7 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
MOBICOM
2010
ACM
15 years 7 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
SIGCOMM
2010
ACM
15 years 7 months ago
Cone of silence: adaptively nulling interferers in wireless networks
Dense 802.11 wireless networks present a pressing capacity challenge: users in proximity contend for limited unlicensed spectrum. Directional antennas promise increased capacity b...
Georgios Nikolaidis, Astrit Zhushi, Kyle Jamieson,...