Sciweavers

29908 search results - page 76 / 5982
» On the complexity of communication complexity
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 10 months ago
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan
DC
2008
13 years 10 months ago
Approximate distributed top- k queries
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 ...
Boaz Patt-Shamir, Allon Shafrir
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 10 months ago
Product theorems via semidefinite programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
Troy Lee, Rajat Mittal
EUROCRYPT
2004
Springer
14 years 3 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
IWC
2007
92views more  IWC 2007»
13 years 10 months ago
Consumers, channels and communication: Online and offline communication in service consumption
This paper reports on a study that investigated consumer use of e-services in a multichannel context. To develop a deeper understanding of what makes consumers decide to use the o...
Geke van Dijk, Shailey Minocha, Angus Laing