Sciweavers

2664 search results - page 400 / 533
» Theory by Process
Sort
View
ICFP
2008
ACM
16 years 6 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
ICFP
2006
ACM
16 years 6 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
MOBIHOC
2006
ACM
16 years 6 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
16 years 3 months ago
Breaking the simulation barrier: SRAM evaluation through norm minimization
— With process variation becoming a growing concern in deep submicron technologies, the ability to efficiently obtain an accurate estimate of failure probability of SRAM compone...
Lara Dolecek, Masood Qazi, Devavrat Shah, Anantha ...