Sciweavers

484 search results - page 56 / 97
» Caching function calls using precise dependencies
Sort
View
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
14 years 6 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
PAMI
1998
86views more  PAMI 1998»
13 years 9 months ago
Spatial Sampling of Printed Patterns
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
Prateek Sarkar, George Nagy, Jiangying Zhou, Danie...
LICS
2010
IEEE
13 years 8 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
POLICY
2001
Springer
14 years 2 months ago
Taxonomy and Description of Policy Combination Methods
To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specifi...
Yasusi Kanada
JNW
2007
75views more  JNW 2007»
13 years 9 months ago
Improving and Analyzing LC-Trie Performance for IP-Address Lookup
— IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our...
Jing Fu, Olof Hagsand, Gunnar Karlsson