Sciweavers

2018 search results - page 48 / 404
» Code Normal Forms
Sort
View
DCC
1993
IEEE
14 years 2 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 10 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar
OSDI
2000
ACM
13 years 11 months ago
Knit: Component Composition for Systems Software
Knit is a new component definition and linking language for systems code. Knit helps make C code more understandable and reusable by third parties, helps eliminate much of the per...
Alastair Reid, Matthew Flatt, Leigh Stoller, Jay L...
TLCA
2005
Springer
14 years 3 months ago
Continuity and Discontinuity in Lambda Calculus
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite...
Paula Severi, Fer-Jan de Vries
EUROPAR
2007
Springer
14 years 1 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...