489 search results - page 42 / 98 » Communication Complexity of Permutation-Invariant Functions |
135
click to vote
DATE
2003
IEEE
2003
IEEE
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
15 years 11 months ago
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...
131
click to vote
VTC
2006
IEEE
15 years 12 months ago
2006
IEEE
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...
158
click to vote
PCI
2005
Springer
15 years 11 months ago
2005
Springer
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
148
click to vote
MOBICOM
1997
ACM
15 years 10 months ago
1997
ACM
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...
155
click to vote
INFOCOM
1996
IEEE
15 years 10 months ago
1996
IEEE
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...