Sciweavers

29908 search results - page 83 / 5982
» On the complexity of communication complexity
Sort
View
RTA
2010
Springer
14 years 2 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
14 years 2 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
EJC
2000
13 years 11 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
CORR
2008
Springer
57views Education» more  CORR 2008»
13 years 10 months ago
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
Smarajit Das, B. Sundar Rajan
PODS
2011
ACM
229views Database» more  PODS 2011»
13 years 1 months ago
On the complexity of privacy-preserving complex event processing
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Nau...