4616 search results - page 186 / 924 » The Communication Complexity of Correlation |
142
click to vote
ICMCS
2007
IEEE
16 years 28 days ago
2007
IEEE
In inter-picture coding, block-based frequency transform is usually carried out on the predicted errors for each interblock to remove the spatial correlation among them. However, ...
175
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
183
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
200
click to vote
DC
2008
15 years 6 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
193
click to vote
EUROCRYPT
2004
Springer
16 years 8 hour ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...