Sciweavers

3047 search results - page 518 / 610
» On the Meaning of Logical Completeness
Sort
View
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
15 years 10 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
DCC
2007
IEEE
15 years 9 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
GLOBECOM
2009
IEEE
15 years 4 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
IPPS
2009
IEEE
15 years 4 months ago
Performance prediction for running workflows under role-based authorization mechanisms
When investigating the performance of running scientific/ commercial workflows in parallel and distributed systems, we often take into account only the resources allocated to the ...
Ligang He, Mark Calleja, Mark Hayes, Stephen A. Ja...
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis