Sciweavers

58 search results - page 4 / 12
» On Rank vs. Communication Complexity
Sort
View
17
Voted
VTC
2006
IEEE
114views Communications» more  VTC 2006»
14 years 1 months ago
Block-LDPC Codes vs Duo-Binary Turbo-Codes for European Next Generation Wireless Systems
Abstract—In this paper, we investigate the performancecomplexity trade-off for two leading-edge channel coding techniques, namely Duo-Binary Turbo-Codes (DBTC) and Block LDPC Cod...
Thierry Lestable, Ernesto Zimmerman, Marie-H&eacut...
AUTOMATICA
2011
13 years 2 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
SAC
2008
ACM
13 years 5 months ago
Data sharing vs. message passing: synergy or incompatibility?: an implementation-driven case study
One reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and...
Matteo Ceriotti, Amy L. Murphy, Gian Pietro Picco
WWW
2008
ACM
14 years 8 months ago
Restful web services vs. "big"' web services: making the right architectural decision
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
Cesare Pautasso, Olaf Zimmermann, Frank Leymann
XMLSEC
2003
ACM
14 years 20 days ago
An access control framework for business processes for web services
Business Processes for Web Services are the new paradigm for the lightweight integration of business from different enterprises. Whereas the security and access control policies ...
Hristo Koshutanski, Fabio Massacci