77 search results - page 10 / 16 » Probabilistic Communication Complexity Over The Reals |
190
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
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...
185
click to vote
WWW
2011
ACM
15 years 4 days ago
2011
ACM
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
260
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
166
click to vote
CRYPTO
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
164
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...