Sciweavers

2498 search results - page 433 / 500
» Data Structures with Unpredictable Timing
Sort
View
SIGCOMM
1997
ACM
15 years 2 months ago
Small Forwarding Tables for Fast Routing Lookups
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
FPGA
1992
ACM
176views FPGA» more  FPGA 1992»
15 years 1 months ago
Minimization of Permuted Reed-Muller Trees for Cellular Logic
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...
Li-Fei Wu, Marek A. Perkowski
PEPM
1992
ACM
15 years 1 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
ACMSE
2007
ACM
15 years 1 months ago
Hierarchical land cover information retrieval in object-oriented remote sensing image databases with native queries
Classification and change detection of land cover types in the remotely sensed images is one of the major applications in remote sensing. This paper presents a hierarchical framew...
Jiang Li