Sciweavers

652 search results - page 22 / 131
» fast 2004
Sort
View
ICFP
2004
ACM
14 years 7 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
DCC
2004
IEEE
14 years 7 months ago
Fast Compression with a Static Model in High-Order Entropy
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffre...
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
14 years 4 months ago
A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
14 years 29 days ago
Fast, predictable and low energy memory references through architecture-aware compilation
The design of future high-performance embedded systems is hampered by two problems: First, the required hardware needs more energy than is available from batteries. Second, curren...
Peter Marwedel, Lars Wehmeyer, Manish Verma, Stefa...
ASPDAC
2004
ACM
76views Hardware» more  ASPDAC 2004»
14 years 29 days ago
A fast method to derive minimum SOPs for decomposable functions
- This paper shows that divide-and-conquer derives a minimum sum-of-products expression (MSOP) of functions that have an AND bi-decomposition when at least one of the subfunctions ...
Tsutomu Sasao, Jon T. Butler