Sciweavers

4311 search results - page 267 / 863
» Code Generation for Distributed Systems
Sort
View
POPL
1995
ACM
15 years 10 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy
SISW
2005
IEEE
16 years 6 days ago
Lazy Revocation in Cryptographic File Systems
A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management s...
Michael Backes, Christian Cachin, Alina Oprea
174
Voted
TIT
2008
83views more  TIT 2008»
15 years 6 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
152
Voted
PADS
2006
ACM
16 years 18 days ago
Modeling Autonomous-System Relationships
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
Xenofontas A. Dimitropoulos, George F. Riley
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris