Sciweavers

91 search results - page 12 / 19
» Multiparty Communication Complexity of Disjointness
Sort
View
TOC
2008
89views more  TOC 2008»
13 years 7 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
ACNS
2006
Springer
138views Cryptology» more  ACNS 2006»
13 years 11 months ago
Syntax-Driven Private Evaluation of Quantified Membership Queries
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
Aggelos Kiayias, Antonina Mitrofanova
ISCC
1999
IEEE
13 years 11 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
NETGAMES
2006
ACM
14 years 1 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
GLOBECOM
2007
IEEE
13 years 11 months ago
Complex Nakagami Channel Simulator with Accurate Phase and Auto-Correlation Properties
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...
Yao Ma, Dongbo Zhang