Sciweavers

489 search results - page 42 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
15 years 3 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu
VTC
2006
IEEE
114views Communications» more  VTC 2006»
15 years 4 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...
PCI
2005
Springer
15 years 4 months ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...
MOBICOM
1997
ACM
15 years 2 months ago
Composable ad-hoc Mobile Services for Universal Interaction
This paperintroduces the notion of “universalinteraction,” allowing a device to adapt its functionality to exploit services it discovers as it moves into a new environment. Us...
Todd D. Hodes, Randy H. Katz, Edouard Servan-Schre...
INFOCOM
1996
IEEE
15 years 2 months ago
Flow Labelled IP: A Connectionless Approach to ATM
A number of proposals for supporting IP over ATM are under discussion in the networking community including: LAN emulation, classical IP over ATM, routing over large clouds, and m...
Peter Newman, Thomas L. Lyon, Greg Minshall